./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:19:21,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:19:21,437 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:19:21,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:19:21,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:19:21,446 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:19:21,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:19:21,448 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:19:21,449 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:19:21,450 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:19:21,450 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:19:21,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:19:21,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:19:21,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:19:21,452 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:19:21,453 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:19:21,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:19:21,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:19:21,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:19:21,457 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:19:21,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:19:21,458 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:19:21,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:19:21,460 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:19:21,460 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:19:21,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:19:21,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:19:21,462 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:19:21,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:19:21,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:19:21,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:19:21,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:19:21,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:19:21,464 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:19:21,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:19:21,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:19:21,465 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:19:21,474 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:19:21,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:19:21,474 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:19:21,475 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:19:21,475 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:19:21,475 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:19:21,475 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:19:21,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:19:21,476 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:19:21,476 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:19:21,476 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:19:21,476 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:19:21,476 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:19:21,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:19:21,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:19:21,476 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:19:21,477 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:19:21,477 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:19:21,477 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:19:21,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:19:21,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:19:21,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:19:21,477 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:19:21,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:19:21,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:19:21,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:19:21,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:19:21,478 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:19:21,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:19:21,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:19:21,478 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_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 [2018-11-28 12:19:21,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:19:21,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:19:21,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:19:21,521 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:19:21,521 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:19:21,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-11-28 12:19:21,567 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data/ba0f7cfc5/de7d40455b674b2282e25734c7cfc85d/FLAG71c3542a8 [2018-11-28 12:19:21,989 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:19:21,989 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-11-28 12:19:22,003 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data/ba0f7cfc5/de7d40455b674b2282e25734c7cfc85d/FLAG71c3542a8 [2018-11-28 12:19:22,334 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data/ba0f7cfc5/de7d40455b674b2282e25734c7cfc85d [2018-11-28 12:19:22,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:19:22,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:19:22,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:19:22,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:19:22,340 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:19:22,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4113b024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22, skipping insertion in model container [2018-11-28 12:19:22,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:19:22,382 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:19:22,674 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:19:22,687 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:19:22,763 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:19:22,778 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:19:22,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22 WrapperNode [2018-11-28 12:19:22,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:19:22,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:19:22,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:19:22,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:19:22,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:19:22,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:19:22,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:19:22,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:19:22,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... [2018-11-28 12:19:22,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:19:22,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:19:22,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:19:22,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:19:22,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:19:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 12:19:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:19:22,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:19:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:19:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:19:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:19:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:19:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:19:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 12:19:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-28 12:19:22,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-28 12:19:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:19:22,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:19:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:19:22,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:19:23,135 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:19:23,135 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:19:23,639 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:19:23,639 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:19:23,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:19:23 BoogieIcfgContainer [2018-11-28 12:19:23,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:19:23,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:19:23,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:19:23,642 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:19:23,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:19:22" (1/3) ... [2018-11-28 12:19:23,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f81bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:19:23, skipping insertion in model container [2018-11-28 12:19:23,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:22" (2/3) ... [2018-11-28 12:19:23,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f81bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:19:23, skipping insertion in model container [2018-11-28 12:19:23,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:19:23" (3/3) ... [2018-11-28 12:19:23,645 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-11-28 12:19:23,651 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:19:23,657 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:19:23,666 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:19:23,687 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:19:23,687 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:19:23,687 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:19:23,687 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:19:23,688 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:19:23,688 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:19:23,688 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:19:23,688 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:19:23,688 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:19:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-11-28 12:19:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 12:19:23,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:23,709 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] [2018-11-28 12:19:23,711 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:23,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:23,714 INFO L82 PathProgramCache]: Analyzing trace with hash -995657757, now seen corresponding path program 1 times [2018-11-28 12:19:23,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:23,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:23,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:23,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:23,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:23,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:23,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:23,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:23,975 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2018-11-28 12:19:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:24,275 INFO L93 Difference]: Finished difference Result 333 states and 558 transitions. [2018-11-28 12:19:24,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:24,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-28 12:19:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:24,285 INFO L225 Difference]: With dead ends: 333 [2018-11-28 12:19:24,285 INFO L226 Difference]: Without dead ends: 169 [2018-11-28 12:19:24,288 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-11-28 12:19:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-28 12:19:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-11-28 12:19:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-28 12:19:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2018-11-28 12:19:24,324 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2018-11-28 12:19:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:24,324 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2018-11-28 12:19:24,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2018-11-28 12:19:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:19:24,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:24,326 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] [2018-11-28 12:19:24,327 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:24,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1978591950, now seen corresponding path program 1 times [2018-11-28 12:19:24,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:24,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:24,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:24,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:24,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:24,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:24,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:24,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:24,449 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2018-11-28 12:19:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:24,663 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2018-11-28 12:19:24,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:24,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-28 12:19:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:24,665 INFO L225 Difference]: With dead ends: 296 [2018-11-28 12:19:24,665 INFO L226 Difference]: Without dead ends: 169 [2018-11-28 12:19:24,666 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-11-28 12:19:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-28 12:19:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-11-28 12:19:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-28 12:19:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2018-11-28 12:19:24,673 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2018-11-28 12:19:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:24,673 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2018-11-28 12:19:24,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2018-11-28 12:19:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:19:24,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:24,675 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] [2018-11-28 12:19:24,675 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:24,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash -659098542, now seen corresponding path program 1 times [2018-11-28 12:19:24,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:24,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:24,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:24,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:24,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:24,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:19:24,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:19:24,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:19:24,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:19:24,785 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 5 states. [2018-11-28 12:19:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:25,110 INFO L93 Difference]: Finished difference Result 300 states and 457 transitions. [2018-11-28 12:19:25,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:19:25,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-11-28 12:19:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:25,111 INFO L225 Difference]: With dead ends: 300 [2018-11-28 12:19:25,111 INFO L226 Difference]: Without dead ends: 173 [2018-11-28 12:19:25,112 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-11-28 12:19:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-28 12:19:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-11-28 12:19:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-28 12:19:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2018-11-28 12:19:25,122 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2018-11-28 12:19:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:25,122 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2018-11-28 12:19:25,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:19:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2018-11-28 12:19:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:19:25,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:25,124 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] [2018-11-28 12:19:25,124 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:25,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1162543817, now seen corresponding path program 1 times [2018-11-28 12:19:25,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:25,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:25,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:25,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:25,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:25,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:25,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:25,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:25,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:25,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:25,208 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2018-11-28 12:19:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:25,457 INFO L93 Difference]: Finished difference Result 333 states and 497 transitions. [2018-11-28 12:19:25,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:25,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-28 12:19:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:25,459 INFO L225 Difference]: With dead ends: 333 [2018-11-28 12:19:25,459 INFO L226 Difference]: Without dead ends: 186 [2018-11-28 12:19:25,460 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-11-28 12:19:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-28 12:19:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-11-28 12:19:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-28 12:19:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2018-11-28 12:19:25,468 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2018-11-28 12:19:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:25,468 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2018-11-28 12:19:25,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2018-11-28 12:19:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:19:25,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:25,469 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] [2018-11-28 12:19:25,469 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:25,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash -480987638, now seen corresponding path program 1 times [2018-11-28 12:19:25,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:25,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:25,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:25,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:25,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:25,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:25,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:25,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:25,526 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2018-11-28 12:19:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:25,675 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2018-11-28 12:19:25,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:25,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-28 12:19:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:25,676 INFO L225 Difference]: With dead ends: 332 [2018-11-28 12:19:25,676 INFO L226 Difference]: Without dead ends: 185 [2018-11-28 12:19:25,677 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-11-28 12:19:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-28 12:19:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-11-28 12:19:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-28 12:19:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2018-11-28 12:19:25,683 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2018-11-28 12:19:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:25,683 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2018-11-28 12:19:25,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2018-11-28 12:19:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 12:19:25,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:25,685 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] [2018-11-28 12:19:25,685 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:25,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2014271313, now seen corresponding path program 1 times [2018-11-28 12:19:25,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:25,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:25,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:25,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:25,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:25,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:25,740 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2018-11-28 12:19:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:25,863 INFO L93 Difference]: Finished difference Result 332 states and 494 transitions. [2018-11-28 12:19:25,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:25,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-28 12:19:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:25,864 INFO L225 Difference]: With dead ends: 332 [2018-11-28 12:19:25,864 INFO L226 Difference]: Without dead ends: 185 [2018-11-28 12:19:25,865 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-11-28 12:19:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-28 12:19:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-11-28 12:19:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-28 12:19:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2018-11-28 12:19:25,870 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2018-11-28 12:19:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:25,871 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2018-11-28 12:19:25,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2018-11-28 12:19:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:19:25,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:25,872 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] [2018-11-28 12:19:25,872 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:25,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash -515871290, now seen corresponding path program 1 times [2018-11-28 12:19:25,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:25,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:25,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:25,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:25,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:25,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:25,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:25,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:25,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:25,928 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2018-11-28 12:19:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:26,066 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2018-11-28 12:19:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:26,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-28 12:19:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:26,067 INFO L225 Difference]: With dead ends: 332 [2018-11-28 12:19:26,067 INFO L226 Difference]: Without dead ends: 185 [2018-11-28 12:19:26,068 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-11-28 12:19:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-28 12:19:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-11-28 12:19:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-28 12:19:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2018-11-28 12:19:26,072 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2018-11-28 12:19:26,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:26,072 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2018-11-28 12:19:26,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2018-11-28 12:19:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 12:19:26,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:26,073 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] [2018-11-28 12:19:26,073 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:26,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash -623975095, now seen corresponding path program 1 times [2018-11-28 12:19:26,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:26,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:26,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:26,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:26,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:26,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:26,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:26,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:26,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:26,110 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2018-11-28 12:19:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:26,258 INFO L93 Difference]: Finished difference Result 361 states and 539 transitions. [2018-11-28 12:19:26,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:26,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-28 12:19:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:26,260 INFO L225 Difference]: With dead ends: 361 [2018-11-28 12:19:26,260 INFO L226 Difference]: Without dead ends: 214 [2018-11-28 12:19:26,260 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-11-28 12:19:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-28 12:19:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-11-28 12:19:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2018-11-28 12:19:26,264 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 58 [2018-11-28 12:19:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:26,265 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2018-11-28 12:19:26,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2018-11-28 12:19:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 12:19:26,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:26,265 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] [2018-11-28 12:19:26,266 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:26,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1702821866, now seen corresponding path program 1 times [2018-11-28 12:19:26,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:26,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:26,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:26,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:26,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:26,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:26,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:26,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:26,302 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 4 states. [2018-11-28 12:19:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:26,438 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2018-11-28 12:19:26,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:26,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-28 12:19:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:26,439 INFO L225 Difference]: With dead ends: 376 [2018-11-28 12:19:26,439 INFO L226 Difference]: Without dead ends: 207 [2018-11-28 12:19:26,440 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-11-28 12:19:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-28 12:19:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-11-28 12:19:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2018-11-28 12:19:26,445 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2018-11-28 12:19:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:26,446 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2018-11-28 12:19:26,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2018-11-28 12:19:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 12:19:26,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:26,447 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] [2018-11-28 12:19:26,447 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:26,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash 480798369, now seen corresponding path program 1 times [2018-11-28 12:19:26,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:26,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:26,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:26,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:26,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:26,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:26,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:26,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:26,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:26,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:26,490 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2018-11-28 12:19:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:26,650 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2018-11-28 12:19:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:26,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-28 12:19:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:26,651 INFO L225 Difference]: With dead ends: 366 [2018-11-28 12:19:26,651 INFO L226 Difference]: Without dead ends: 197 [2018-11-28 12:19:26,652 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-11-28 12:19:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-28 12:19:26,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-11-28 12:19:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:26,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2018-11-28 12:19:26,658 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2018-11-28 12:19:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:26,658 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2018-11-28 12:19:26,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2018-11-28 12:19:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:19:26,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:26,659 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] [2018-11-28 12:19:26,659 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:26,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1484856716, now seen corresponding path program 1 times [2018-11-28 12:19:26,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:26,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:26,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:26,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:26,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:26,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:26,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:26,761 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2018-11-28 12:19:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:26,986 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2018-11-28 12:19:26,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:26,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-11-28 12:19:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:26,988 INFO L225 Difference]: With dead ends: 383 [2018-11-28 12:19:26,988 INFO L226 Difference]: Without dead ends: 214 [2018-11-28 12:19:26,989 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-11-28 12:19:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-28 12:19:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-11-28 12:19:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:26,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2018-11-28 12:19:26,996 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2018-11-28 12:19:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:26,996 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2018-11-28 12:19:26,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:26,997 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2018-11-28 12:19:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 12:19:26,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:26,997 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] [2018-11-28 12:19:26,998 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:26,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:26,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1155270063, now seen corresponding path program 1 times [2018-11-28 12:19:26,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:26,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:26,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:26,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:26,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:27,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:27,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:27,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:27,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:27,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:27,052 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2018-11-28 12:19:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:27,283 INFO L93 Difference]: Finished difference Result 381 states and 569 transitions. [2018-11-28 12:19:27,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:27,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-11-28 12:19:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:27,285 INFO L225 Difference]: With dead ends: 381 [2018-11-28 12:19:27,285 INFO L226 Difference]: Without dead ends: 212 [2018-11-28 12:19:27,285 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-11-28 12:19:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-28 12:19:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-11-28 12:19:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2018-11-28 12:19:27,294 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2018-11-28 12:19:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:27,294 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2018-11-28 12:19:27,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2018-11-28 12:19:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 12:19:27,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:27,295 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] [2018-11-28 12:19:27,295 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:27,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:27,295 INFO L82 PathProgramCache]: Analyzing trace with hash -488261392, now seen corresponding path program 1 times [2018-11-28 12:19:27,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:27,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:27,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:27,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:27,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:27,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:27,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:27,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:27,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:27,346 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2018-11-28 12:19:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:27,550 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-11-28 12:19:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:27,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-11-28 12:19:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:27,553 INFO L225 Difference]: With dead ends: 380 [2018-11-28 12:19:27,553 INFO L226 Difference]: Without dead ends: 211 [2018-11-28 12:19:27,553 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-11-28 12:19:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-28 12:19:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-11-28 12:19:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2018-11-28 12:19:27,561 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2018-11-28 12:19:27,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:27,561 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2018-11-28 12:19:27,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2018-11-28 12:19:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 12:19:27,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:27,562 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] [2018-11-28 12:19:27,562 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:27,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2055209609, now seen corresponding path program 1 times [2018-11-28 12:19:27,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:27,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:27,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:27,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:27,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:27,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:27,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:27,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:27,614 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2018-11-28 12:19:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:27,811 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-11-28 12:19:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:27,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-28 12:19:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:27,813 INFO L225 Difference]: With dead ends: 380 [2018-11-28 12:19:27,813 INFO L226 Difference]: Without dead ends: 211 [2018-11-28 12:19:27,814 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-11-28 12:19:27,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-28 12:19:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-11-28 12:19:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-11-28 12:19:27,820 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2018-11-28 12:19:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:27,821 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-11-28 12:19:27,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-11-28 12:19:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 12:19:27,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:27,822 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] [2018-11-28 12:19:27,822 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:27,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1083985708, now seen corresponding path program 1 times [2018-11-28 12:19:27,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:27,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:27,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:27,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:27,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:27,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:27,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:27,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:27,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:27,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:27,887 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2018-11-28 12:19:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:28,150 INFO L93 Difference]: Finished difference Result 380 states and 562 transitions. [2018-11-28 12:19:28,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:28,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-28 12:19:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:28,151 INFO L225 Difference]: With dead ends: 380 [2018-11-28 12:19:28,152 INFO L226 Difference]: Without dead ends: 211 [2018-11-28 12:19:28,152 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-11-28 12:19:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-28 12:19:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-11-28 12:19:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-11-28 12:19:28,158 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2018-11-28 12:19:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:28,158 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-11-28 12:19:28,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-11-28 12:19:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 12:19:28,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:28,159 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] [2018-11-28 12:19:28,160 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:28,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash -241218748, now seen corresponding path program 1 times [2018-11-28 12:19:28,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:28,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:28,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:28,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:28,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:28,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:28,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:28,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:28,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:28,218 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2018-11-28 12:19:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:28,395 INFO L93 Difference]: Finished difference Result 380 states and 560 transitions. [2018-11-28 12:19:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:28,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-11-28 12:19:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:28,396 INFO L225 Difference]: With dead ends: 380 [2018-11-28 12:19:28,396 INFO L226 Difference]: Without dead ends: 211 [2018-11-28 12:19:28,397 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-11-28 12:19:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-28 12:19:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-11-28 12:19:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2018-11-28 12:19:28,403 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2018-11-28 12:19:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:28,403 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2018-11-28 12:19:28,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2018-11-28 12:19:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 12:19:28,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:28,404 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] [2018-11-28 12:19:28,404 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:28,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash 345081479, now seen corresponding path program 1 times [2018-11-28 12:19:28,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:28,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:28,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:28,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:28,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:28,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:28,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:28,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:28,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:28,487 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2018-11-28 12:19:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:28,669 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-11-28 12:19:28,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:28,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-11-28 12:19:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:28,671 INFO L225 Difference]: With dead ends: 370 [2018-11-28 12:19:28,671 INFO L226 Difference]: Without dead ends: 201 [2018-11-28 12:19:28,671 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-11-28 12:19:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-28 12:19:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-11-28 12:19:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:19:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-11-28 12:19:28,680 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2018-11-28 12:19:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:28,680 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-11-28 12:19:28,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-11-28 12:19:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 12:19:28,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:28,681 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] [2018-11-28 12:19:28,681 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:28,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1440674399, now seen corresponding path program 1 times [2018-11-28 12:19:28,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:28,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:28,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:28,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:28,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:28,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:28,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:28,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:28,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:28,737 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2018-11-28 12:19:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:29,063 INFO L93 Difference]: Finished difference Result 469 states and 696 transitions. [2018-11-28 12:19:29,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:29,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-28 12:19:29,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:29,066 INFO L225 Difference]: With dead ends: 469 [2018-11-28 12:19:29,066 INFO L226 Difference]: Without dead ends: 300 [2018-11-28 12:19:29,066 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-11-28 12:19:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-28 12:19:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2018-11-28 12:19:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-28 12:19:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2018-11-28 12:19:29,075 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2018-11-28 12:19:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:29,076 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2018-11-28 12:19:29,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2018-11-28 12:19:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 12:19:29,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:29,079 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] [2018-11-28 12:19:29,079 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:29,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:29,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1368287841, now seen corresponding path program 1 times [2018-11-28 12:19:29,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:29,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:29,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:29,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:29,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:29,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:29,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:29,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:29,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:29,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:29,158 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2018-11-28 12:19:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:29,431 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-11-28 12:19:29,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:29,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-28 12:19:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:29,432 INFO L225 Difference]: With dead ends: 472 [2018-11-28 12:19:29,432 INFO L226 Difference]: Without dead ends: 273 [2018-11-28 12:19:29,433 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-11-28 12:19:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-28 12:19:29,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2018-11-28 12:19:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-28 12:19:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2018-11-28 12:19:29,440 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2018-11-28 12:19:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:29,440 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2018-11-28 12:19:29,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2018-11-28 12:19:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 12:19:29,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:29,441 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] [2018-11-28 12:19:29,442 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:29,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2002550352, now seen corresponding path program 1 times [2018-11-28 12:19:29,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:29,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:29,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:29,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:29,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:29,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:29,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:29,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:29,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:29,499 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2018-11-28 12:19:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:29,784 INFO L93 Difference]: Finished difference Result 539 states and 815 transitions. [2018-11-28 12:19:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:29,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-28 12:19:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:29,786 INFO L225 Difference]: With dead ends: 539 [2018-11-28 12:19:29,786 INFO L226 Difference]: Without dead ends: 316 [2018-11-28 12:19:29,786 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-11-28 12:19:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-11-28 12:19:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2018-11-28 12:19:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-28 12:19:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2018-11-28 12:19:29,798 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2018-11-28 12:19:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:29,798 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2018-11-28 12:19:29,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2018-11-28 12:19:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 12:19:29,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:29,799 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] [2018-11-28 12:19:29,800 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:29,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 323004382, now seen corresponding path program 1 times [2018-11-28 12:19:29,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:29,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:29,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:29,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:29,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:29,872 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2018-11-28 12:19:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:30,229 INFO L93 Difference]: Finished difference Result 540 states and 815 transitions. [2018-11-28 12:19:30,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:30,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-28 12:19:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:30,231 INFO L225 Difference]: With dead ends: 540 [2018-11-28 12:19:30,231 INFO L226 Difference]: Without dead ends: 316 [2018-11-28 12:19:30,232 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-11-28 12:19:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-11-28 12:19:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2018-11-28 12:19:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-28 12:19:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2018-11-28 12:19:30,242 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 87 [2018-11-28 12:19:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:30,242 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2018-11-28 12:19:30,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2018-11-28 12:19:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 12:19:30,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:30,244 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] [2018-11-28 12:19:30,244 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:30,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:30,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1206018514, now seen corresponding path program 1 times [2018-11-28 12:19:30,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:30,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:30,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:30,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:30,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:30,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:30,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:30,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:30,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:30,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:30,311 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2018-11-28 12:19:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:30,576 INFO L93 Difference]: Finished difference Result 542 states and 822 transitions. [2018-11-28 12:19:30,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:30,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-28 12:19:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:30,579 INFO L225 Difference]: With dead ends: 542 [2018-11-28 12:19:30,579 INFO L226 Difference]: Without dead ends: 308 [2018-11-28 12:19:30,580 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-11-28 12:19:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-28 12:19:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-11-28 12:19:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-11-28 12:19:30,586 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 88 [2018-11-28 12:19:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:30,586 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-11-28 12:19:30,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-11-28 12:19:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 12:19:30,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:30,587 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] [2018-11-28 12:19:30,588 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:30,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:30,588 INFO L82 PathProgramCache]: Analyzing trace with hash 62751798, now seen corresponding path program 1 times [2018-11-28 12:19:30,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:30,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:30,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:30,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:30,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:30,625 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2018-11-28 12:19:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:30,839 INFO L93 Difference]: Finished difference Result 543 states and 822 transitions. [2018-11-28 12:19:30,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:30,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-28 12:19:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:30,841 INFO L225 Difference]: With dead ends: 543 [2018-11-28 12:19:30,841 INFO L226 Difference]: Without dead ends: 308 [2018-11-28 12:19:30,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:19:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-28 12:19:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-11-28 12:19:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2018-11-28 12:19:30,849 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2018-11-28 12:19:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:30,849 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2018-11-28 12:19:30,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2018-11-28 12:19:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 12:19:30,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:30,850 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] [2018-11-28 12:19:30,850 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:30,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:30,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1991024500, now seen corresponding path program 1 times [2018-11-28 12:19:30,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:30,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:30,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:30,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:30,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:30,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:30,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:30,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:30,891 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2018-11-28 12:19:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:31,071 INFO L93 Difference]: Finished difference Result 520 states and 790 transitions. [2018-11-28 12:19:31,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:31,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-28 12:19:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:31,073 INFO L225 Difference]: With dead ends: 520 [2018-11-28 12:19:31,073 INFO L226 Difference]: Without dead ends: 285 [2018-11-28 12:19:31,073 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-11-28 12:19:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-28 12:19:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2018-11-28 12:19:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2018-11-28 12:19:31,080 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2018-11-28 12:19:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:31,081 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2018-11-28 12:19:31,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2018-11-28 12:19:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 12:19:31,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:31,081 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] [2018-11-28 12:19:31,082 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:31,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:31,082 INFO L82 PathProgramCache]: Analyzing trace with hash 19690565, now seen corresponding path program 1 times [2018-11-28 12:19:31,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:31,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:31,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:31,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:31,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:31,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:31,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:31,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:31,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:31,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:31,124 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2018-11-28 12:19:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:31,331 INFO L93 Difference]: Finished difference Result 541 states and 816 transitions. [2018-11-28 12:19:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:31,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-28 12:19:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:31,333 INFO L225 Difference]: With dead ends: 541 [2018-11-28 12:19:31,333 INFO L226 Difference]: Without dead ends: 306 [2018-11-28 12:19:31,334 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-11-28 12:19:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-28 12:19:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 260. [2018-11-28 12:19:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2018-11-28 12:19:31,340 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2018-11-28 12:19:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:31,340 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2018-11-28 12:19:31,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2018-11-28 12:19:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 12:19:31,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:31,341 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] [2018-11-28 12:19:31,341 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:31,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1623840890, now seen corresponding path program 1 times [2018-11-28 12:19:31,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:31,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:31,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:31,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:31,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:31,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:31,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:31,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:31,378 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2018-11-28 12:19:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:31,590 INFO L93 Difference]: Finished difference Result 540 states and 813 transitions. [2018-11-28 12:19:31,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:31,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-28 12:19:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:31,591 INFO L225 Difference]: With dead ends: 540 [2018-11-28 12:19:31,591 INFO L226 Difference]: Without dead ends: 305 [2018-11-28 12:19:31,592 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-11-28 12:19:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-28 12:19:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-11-28 12:19:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2018-11-28 12:19:31,598 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2018-11-28 12:19:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:31,598 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2018-11-28 12:19:31,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2018-11-28 12:19:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 12:19:31,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:31,599 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] [2018-11-28 12:19:31,599 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:31,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:31,600 INFO L82 PathProgramCache]: Analyzing trace with hash -333397817, now seen corresponding path program 1 times [2018-11-28 12:19:31,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:31,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:31,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:31,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:31,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:31,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:31,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:31,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:31,635 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2018-11-28 12:19:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:31,793 INFO L93 Difference]: Finished difference Result 518 states and 782 transitions. [2018-11-28 12:19:31,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:31,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-28 12:19:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:31,795 INFO L225 Difference]: With dead ends: 518 [2018-11-28 12:19:31,795 INFO L226 Difference]: Without dead ends: 283 [2018-11-28 12:19:31,795 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-11-28 12:19:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-28 12:19:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2018-11-28 12:19:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2018-11-28 12:19:31,802 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2018-11-28 12:19:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:31,802 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2018-11-28 12:19:31,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2018-11-28 12:19:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 12:19:31,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:31,803 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] [2018-11-28 12:19:31,803 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:31,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:31,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1976929272, now seen corresponding path program 1 times [2018-11-28 12:19:31,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:31,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:31,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:31,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:31,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:31,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:31,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:31,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:31,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:31,839 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2018-11-28 12:19:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:31,996 INFO L93 Difference]: Finished difference Result 517 states and 779 transitions. [2018-11-28 12:19:31,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:31,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-28 12:19:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:31,998 INFO L225 Difference]: With dead ends: 517 [2018-11-28 12:19:31,998 INFO L226 Difference]: Without dead ends: 282 [2018-11-28 12:19:31,999 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-11-28 12:19:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-28 12:19:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-11-28 12:19:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2018-11-28 12:19:32,006 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2018-11-28 12:19:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:32,006 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2018-11-28 12:19:32,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2018-11-28 12:19:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 12:19:32,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:32,007 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] [2018-11-28 12:19:32,007 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:32,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1211983539, now seen corresponding path program 1 times [2018-11-28 12:19:32,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:32,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:32,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:32,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:32,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:32,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:32,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:32,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:32,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:32,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:32,037 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2018-11-28 12:19:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:32,239 INFO L93 Difference]: Finished difference Result 540 states and 807 transitions. [2018-11-28 12:19:32,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:32,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-28 12:19:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:32,241 INFO L225 Difference]: With dead ends: 540 [2018-11-28 12:19:32,241 INFO L226 Difference]: Without dead ends: 305 [2018-11-28 12:19:32,241 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-11-28 12:19:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-28 12:19:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-11-28 12:19:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2018-11-28 12:19:32,250 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2018-11-28 12:19:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:32,250 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2018-11-28 12:19:32,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2018-11-28 12:19:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 12:19:32,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:32,251 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] [2018-11-28 12:19:32,251 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:32,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1143821711, now seen corresponding path program 1 times [2018-11-28 12:19:32,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:32,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:32,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:32,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:32,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:32,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:32,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:32,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:32,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:32,285 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2018-11-28 12:19:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:32,455 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-11-28 12:19:32,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:32,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-28 12:19:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:32,456 INFO L225 Difference]: With dead ends: 517 [2018-11-28 12:19:32,457 INFO L226 Difference]: Without dead ends: 282 [2018-11-28 12:19:32,457 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-11-28 12:19:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-28 12:19:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-11-28 12:19:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2018-11-28 12:19:32,465 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2018-11-28 12:19:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:32,465 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2018-11-28 12:19:32,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2018-11-28 12:19:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 12:19:32,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:32,466 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] [2018-11-28 12:19:32,467 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:32,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:32,467 INFO L82 PathProgramCache]: Analyzing trace with hash 713781314, now seen corresponding path program 1 times [2018-11-28 12:19:32,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:32,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:32,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:32,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:32,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:32,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:32,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:32,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:32,508 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2018-11-28 12:19:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:32,716 INFO L93 Difference]: Finished difference Result 540 states and 803 transitions. [2018-11-28 12:19:32,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:32,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-28 12:19:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:32,718 INFO L225 Difference]: With dead ends: 540 [2018-11-28 12:19:32,718 INFO L226 Difference]: Without dead ends: 305 [2018-11-28 12:19:32,719 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-11-28 12:19:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-28 12:19:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-11-28 12:19:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2018-11-28 12:19:32,730 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2018-11-28 12:19:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:32,730 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2018-11-28 12:19:32,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2018-11-28 12:19:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 12:19:32,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:32,732 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] [2018-11-28 12:19:32,732 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:32,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash 698262596, now seen corresponding path program 1 times [2018-11-28 12:19:32,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:32,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:32,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:32,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:32,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:32,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:32,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:32,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:32,788 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2018-11-28 12:19:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:32,967 INFO L93 Difference]: Finished difference Result 517 states and 771 transitions. [2018-11-28 12:19:32,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:32,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-28 12:19:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:32,968 INFO L225 Difference]: With dead ends: 517 [2018-11-28 12:19:32,969 INFO L226 Difference]: Without dead ends: 282 [2018-11-28 12:19:32,969 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-11-28 12:19:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-28 12:19:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-11-28 12:19:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2018-11-28 12:19:32,980 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2018-11-28 12:19:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:32,980 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2018-11-28 12:19:32,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2018-11-28 12:19:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 12:19:32,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:32,981 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] [2018-11-28 12:19:32,981 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:32,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:32,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1167346926, now seen corresponding path program 1 times [2018-11-28 12:19:32,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:32,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:32,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:33,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:33,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:33,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:33,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:33,046 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2018-11-28 12:19:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:33,275 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2018-11-28 12:19:33,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:33,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-11-28 12:19:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:33,277 INFO L225 Difference]: With dead ends: 540 [2018-11-28 12:19:33,277 INFO L226 Difference]: Without dead ends: 305 [2018-11-28 12:19:33,278 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-11-28 12:19:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-28 12:19:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-11-28 12:19:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2018-11-28 12:19:33,286 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2018-11-28 12:19:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:33,287 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2018-11-28 12:19:33,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2018-11-28 12:19:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 12:19:33,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:33,288 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] [2018-11-28 12:19:33,288 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:33,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash 686266668, now seen corresponding path program 1 times [2018-11-28 12:19:33,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:33,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:33,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:33,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:33,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:33,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:33,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:33,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:33,358 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2018-11-28 12:19:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:33,605 INFO L93 Difference]: Finished difference Result 517 states and 767 transitions. [2018-11-28 12:19:33,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:33,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-11-28 12:19:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:33,607 INFO L225 Difference]: With dead ends: 517 [2018-11-28 12:19:33,607 INFO L226 Difference]: Without dead ends: 282 [2018-11-28 12:19:33,608 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-11-28 12:19:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-28 12:19:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-11-28 12:19:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2018-11-28 12:19:33,620 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2018-11-28 12:19:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:33,620 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2018-11-28 12:19:33,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2018-11-28 12:19:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 12:19:33,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:33,621 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] [2018-11-28 12:19:33,621 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:33,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:33,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1060944413, now seen corresponding path program 1 times [2018-11-28 12:19:33,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:33,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:33,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:33,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:33,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:33,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:33,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:33,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:33,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:33,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:33,668 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2018-11-28 12:19:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:33,901 INFO L93 Difference]: Finished difference Result 530 states and 783 transitions. [2018-11-28 12:19:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:33,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-28 12:19:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:33,903 INFO L225 Difference]: With dead ends: 530 [2018-11-28 12:19:33,903 INFO L226 Difference]: Without dead ends: 295 [2018-11-28 12:19:33,903 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-11-28 12:19:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-28 12:19:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-11-28 12:19:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2018-11-28 12:19:33,915 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2018-11-28 12:19:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:33,916 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2018-11-28 12:19:33,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2018-11-28 12:19:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 12:19:33,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:33,917 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] [2018-11-28 12:19:33,917 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:33,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash -967641697, now seen corresponding path program 1 times [2018-11-28 12:19:33,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:33,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:33,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:33,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:33,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:33,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:33,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:33,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:33,969 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2018-11-28 12:19:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:34,104 INFO L93 Difference]: Finished difference Result 507 states and 751 transitions. [2018-11-28 12:19:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:34,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-28 12:19:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:34,106 INFO L225 Difference]: With dead ends: 507 [2018-11-28 12:19:34,106 INFO L226 Difference]: Without dead ends: 272 [2018-11-28 12:19:34,107 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-11-28 12:19:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-28 12:19:34,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2018-11-28 12:19:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2018-11-28 12:19:34,116 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2018-11-28 12:19:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:34,116 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2018-11-28 12:19:34,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2018-11-28 12:19:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 12:19:34,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:34,117 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] [2018-11-28 12:19:34,117 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:34,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1531434557, now seen corresponding path program 1 times [2018-11-28 12:19:34,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:34,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:34,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:34,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:34,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:34,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:34,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:34,159 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2018-11-28 12:19:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:34,356 INFO L93 Difference]: Finished difference Result 530 states and 779 transitions. [2018-11-28 12:19:34,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:34,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-28 12:19:34,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:34,357 INFO L225 Difference]: With dead ends: 530 [2018-11-28 12:19:34,357 INFO L226 Difference]: Without dead ends: 295 [2018-11-28 12:19:34,358 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-11-28 12:19:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-28 12:19:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-11-28 12:19:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:19:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2018-11-28 12:19:34,366 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2018-11-28 12:19:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:34,366 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2018-11-28 12:19:34,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2018-11-28 12:19:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 12:19:34,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:34,367 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] [2018-11-28 12:19:34,367 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:34,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash -144649147, now seen corresponding path program 1 times [2018-11-28 12:19:34,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:34,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:34,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:34,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 12:19:34,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:34,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:34,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:19:34,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:34,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:34,405 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2018-11-28 12:19:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:34,452 INFO L93 Difference]: Finished difference Result 728 states and 1080 transitions. [2018-11-28 12:19:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:34,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-28 12:19:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:34,454 INFO L225 Difference]: With dead ends: 728 [2018-11-28 12:19:34,454 INFO L226 Difference]: Without dead ends: 493 [2018-11-28 12:19:34,455 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-11-28 12:19:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-11-28 12:19:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-11-28 12:19:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-11-28 12:19:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2018-11-28 12:19:34,469 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2018-11-28 12:19:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:34,469 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2018-11-28 12:19:34,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:19:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2018-11-28 12:19:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 12:19:34,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:34,471 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] [2018-11-28 12:19:34,471 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:34,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash -282131921, now seen corresponding path program 1 times [2018-11-28 12:19:34,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:34,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:34,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:34,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-28 12:19:34,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:34,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:34,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:19:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:34,499 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2018-11-28 12:19:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:34,555 INFO L93 Difference]: Finished difference Result 1196 states and 1769 transitions. [2018-11-28 12:19:34,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:34,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-28 12:19:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:34,557 INFO L225 Difference]: With dead ends: 1196 [2018-11-28 12:19:34,557 INFO L226 Difference]: Without dead ends: 728 [2018-11-28 12:19:34,558 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-11-28 12:19:34,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-11-28 12:19:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-11-28 12:19:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-28 12:19:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2018-11-28 12:19:34,578 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2018-11-28 12:19:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:34,579 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2018-11-28 12:19:34,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:19:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2018-11-28 12:19:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 12:19:34,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:34,580 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] [2018-11-28 12:19:34,580 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:34,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -125424114, now seen corresponding path program 1 times [2018-11-28 12:19:34,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-28 12:19:34,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:34,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:34,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:19:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:34,617 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2018-11-28 12:19:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:34,682 INFO L93 Difference]: Finished difference Result 1662 states and 2463 transitions. [2018-11-28 12:19:34,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:34,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-11-28 12:19:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:34,685 INFO L225 Difference]: With dead ends: 1662 [2018-11-28 12:19:34,685 INFO L226 Difference]: Without dead ends: 961 [2018-11-28 12:19:34,686 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-11-28 12:19:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-11-28 12:19:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-11-28 12:19:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-11-28 12:19:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2018-11-28 12:19:34,713 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 111 [2018-11-28 12:19:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:34,714 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2018-11-28 12:19:34,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:19:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2018-11-28 12:19:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-28 12:19:34,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:34,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:34,716 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:34,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1174112374, now seen corresponding path program 1 times [2018-11-28 12:19:34,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:34,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-28 12:19:34,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:34,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:34,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:34,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:34,770 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2018-11-28 12:19:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:35,084 INFO L93 Difference]: Finished difference Result 2303 states and 3401 transitions. [2018-11-28 12:19:35,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:35,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-28 12:19:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:35,087 INFO L225 Difference]: With dead ends: 2303 [2018-11-28 12:19:35,087 INFO L226 Difference]: Without dead ends: 1369 [2018-11-28 12:19:35,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:19:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2018-11-28 12:19:35,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2018-11-28 12:19:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-11-28 12:19:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2018-11-28 12:19:35,143 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 128 [2018-11-28 12:19:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:35,143 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2018-11-28 12:19:35,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2018-11-28 12:19:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-28 12:19:35,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:35,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:35,145 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:35,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:35,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2040039334, now seen corresponding path program 1 times [2018-11-28 12:19:35,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:35,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-28 12:19:35,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:35,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:35,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:19:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:35,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:35,218 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2018-11-28 12:19:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:35,526 INFO L93 Difference]: Finished difference Result 2433 states and 3649 transitions. [2018-11-28 12:19:35,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:35,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-11-28 12:19:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:35,530 INFO L225 Difference]: With dead ends: 2433 [2018-11-28 12:19:35,530 INFO L226 Difference]: Without dead ends: 1343 [2018-11-28 12:19:35,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:19:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2018-11-28 12:19:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1075. [2018-11-28 12:19:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-11-28 12:19:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2018-11-28 12:19:35,569 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 129 [2018-11-28 12:19:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:35,570 INFO L480 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2018-11-28 12:19:35,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:19:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2018-11-28 12:19:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-28 12:19:35,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:35,572 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:35,572 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:35,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2028637021, now seen corresponding path program 1 times [2018-11-28 12:19:35,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:35,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:35,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:35,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:35,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 12:19:35,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:35,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:19:35,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:19:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:19:35,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:19:35,837 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 7 states. [2018-11-28 12:19:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:36,648 INFO L93 Difference]: Finished difference Result 3503 states and 5230 transitions. [2018-11-28 12:19:36,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:19:36,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-11-28 12:19:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:36,656 INFO L225 Difference]: With dead ends: 3503 [2018-11-28 12:19:36,656 INFO L226 Difference]: Without dead ends: 2453 [2018-11-28 12:19:36,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:19:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2018-11-28 12:19:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1705. [2018-11-28 12:19:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2018-11-28 12:19:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2556 transitions. [2018-11-28 12:19:36,729 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2556 transitions. Word has length 133 [2018-11-28 12:19:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:36,730 INFO L480 AbstractCegarLoop]: Abstraction has 1705 states and 2556 transitions. [2018-11-28 12:19:36,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:19:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2556 transitions. [2018-11-28 12:19:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-28 12:19:36,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:36,732 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:36,732 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:36,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1236970977, now seen corresponding path program 1 times [2018-11-28 12:19:36,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:36,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:36,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:19:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:19:36,896 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 12:19:36,939 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-11-28 12:19:36,940 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24608 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 12:19:36,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:19:36 BoogieIcfgContainer [2018-11-28 12:19:36,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:19:36,991 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:19:36,991 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:19:36,991 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:19:36,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:19:23" (3/4) ... [2018-11-28 12:19:36,997 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:19:36,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:19:36,998 INFO L168 Benchmark]: Toolchain (without parser) took 14661.79 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 526.9 MB). Free memory was 954.9 MB in the beginning and 988.3 MB in the end (delta: -33.3 MB). Peak memory consumption was 493.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:19:36,999 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:19:36,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:19:37,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:19:37,003 INFO L168 Benchmark]: Boogie Preprocessor took 61.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:19:37,003 INFO L168 Benchmark]: RCFGBuilder took 769.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.8 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:19:37,004 INFO L168 Benchmark]: TraceAbstraction took 13350.37 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 372.8 MB). Free memory was 1.0 GB in the beginning and 988.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 421.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:19:37,004 INFO L168 Benchmark]: Witness Printer took 6.41 ms. Allocated memory is still 1.6 GB. Free memory is still 988.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:19:37,006 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 441.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 769.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.8 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13350.37 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 372.8 MB). Free memory was 1.0 GB in the beginning and 988.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 421.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.41 ms. Allocated memory is still 1.6 GB. Free memory is still 988.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 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 24608 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: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1444. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24620, \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)) VAL [init=1, malloc(sizeof(SSL))={24590:0}, malloc(sizeof(SSL_CTX))={24621:0}, malloc(sizeof(SSL_SESSION))={24579:0}, malloc(sizeof(struct ssl3_state_st))={24616:0}, s={24590:0}, SSLv3_server_data={24587:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24590:0}, SSLv3_server_data={24587:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [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={24590:0}, s={24590:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24602, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->hit=0, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24602, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={2:-1}, ((s->s3)->tmp.new_cipher)->algorithms=24606, (s->s3)->tmp.new_cipher={24601:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1370] COND FALSE !(ret <= 0) VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24602, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, l=24606, ret=1, s={24590:0}, s={24590:0}, s->options=24610, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp VAL [={2:-1}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=24606, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1411] COND FALSE !(ret <= 0) VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24602, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->verify_mode=24580, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [={2:-1}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->session={24579:0}, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={2:-1}, ((s->s3)->tmp.new_cipher)->algorithms=24606, (s->s3)->tmp.new_cipher={24601:0}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 7 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=0, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1726] __VERIFIER_error() VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=0, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 1 error locations. UNSAFE Result, 13.3s OverallTime, 44 OverallIterations, 5 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9144 SDtfs, 2959 SDslu, 13377 SDs, 0 SdLazy, 8422 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 88 SyntacticMatches, 77 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1705occurred in iteration=43, 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.5s AutomataMinimizationTime, 43 MinimizatonAttempts, 2276 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3753 NumberOfCodeBlocks, 3753 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3577 ConstructedInterpolants, 0 QuantifiedInterpolants, 1033875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 2080/2080 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-0cd3be1 [2018-11-28 12:19:38,607 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:19:38,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:19:38,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:19:38,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:19:38,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:19:38,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:19:38,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:19:38,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:19:38,620 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:19:38,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:19:38,621 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:19:38,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:19:38,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:19:38,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:19:38,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:19:38,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:19:38,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:19:38,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:19:38,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:19:38,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:19:38,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:19:38,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:19:38,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:19:38,633 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:19:38,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:19:38,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:19:38,635 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:19:38,637 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:19:38,638 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:19:38,638 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:19:38,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:19:38,639 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:19:38,639 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:19:38,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:19:38,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:19:38,641 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-28 12:19:38,653 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:19:38,653 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:19:38,654 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:19:38,654 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:19:38,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:19:38,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:19:38,655 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:19:38,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:19:38,655 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:19:38,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:19:38,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:19:38,656 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:19:38,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:19:38,656 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:19:38,657 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 12:19:38,657 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 12:19:38,657 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:19:38,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:19:38,658 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:19:38,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:19:38,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:19:38,658 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:19:38,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:19:38,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:19:38,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:19:38,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:19:38,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:19:38,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:19:38,659 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 12:19:38,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:19:38,659 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 12:19:38,659 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 12:19:38,659 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_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 [2018-11-28 12:19:38,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:19:38,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:19:38,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:19:38,701 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:19:38,702 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:19:38,702 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-11-28 12:19:38,743 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data/b0738907b/9f7700959c914b6495ac09adb1af2060/FLAGdac3b6e7c [2018-11-28 12:19:39,220 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:19:39,221 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-11-28 12:19:39,234 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data/b0738907b/9f7700959c914b6495ac09adb1af2060/FLAGdac3b6e7c [2018-11-28 12:19:39,719 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/data/b0738907b/9f7700959c914b6495ac09adb1af2060 [2018-11-28 12:19:39,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:19:39,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:19:39,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:19:39,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:19:39,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:19:39,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:19:39" (1/1) ... [2018-11-28 12:19:39,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570ed386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:39, skipping insertion in model container [2018-11-28 12:19:39,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:19:39" (1/1) ... [2018-11-28 12:19:39,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:19:39,778 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:19:40,042 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:19:40,116 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:19:40,191 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:19:40,209 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:19:40,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40 WrapperNode [2018-11-28 12:19:40,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:19:40,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:19:40,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:19:40,210 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:19:40,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... [2018-11-28 12:19:40,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... [2018-11-28 12:19:40,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:19:40,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:19:40,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:19:40,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:19:40,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... [2018-11-28 12:19:40,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... [2018-11-28 12:19:40,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... [2018-11-28 12:19:40,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... [2018-11-28 12:19:40,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... [2018-11-28 12:19:40,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... [2018-11-28 12:19:40,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... [2018-11-28 12:19:40,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:19:40,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:19:40,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:19:40,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:19:40,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:19:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 12:19:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:19:40,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:19:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-28 12:19:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:19:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:19:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-28 12:19:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:19:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-28 12:19:40,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-28 12:19:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:19:40,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:19:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:19:40,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:19:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-28 12:19:40,593 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 12:19:40,593 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 12:19:42,968 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:19:42,969 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:19:42,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:19:42 BoogieIcfgContainer [2018-11-28 12:19:42,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:19:42,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:19:42,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:19:42,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:19:42,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:19:39" (1/3) ... [2018-11-28 12:19:42,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5b6ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:19:42, skipping insertion in model container [2018-11-28 12:19:42,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:19:40" (2/3) ... [2018-11-28 12:19:42,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5b6ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:19:42, skipping insertion in model container [2018-11-28 12:19:42,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:19:42" (3/3) ... [2018-11-28 12:19:42,976 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-11-28 12:19:42,985 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:19:42,992 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:19:43,004 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:19:43,025 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:19:43,025 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:19:43,025 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:19:43,025 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:19:43,026 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:19:43,026 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:19:43,026 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:19:43,026 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:19:43,026 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:19:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-11-28 12:19:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 12:19:43,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:43,045 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] [2018-11-28 12:19:43,046 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:43,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:43,051 INFO L82 PathProgramCache]: Analyzing trace with hash -995657757, now seen corresponding path program 1 times [2018-11-28 12:19:43,056 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 12:19:43,056 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 12:19:43,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:43,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:43,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 12:19:43,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:43,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:43,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:19:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:43,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:43,254 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 3 states. [2018-11-28 12:19:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:43,381 INFO L93 Difference]: Finished difference Result 435 states and 736 transitions. [2018-11-28 12:19:43,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:43,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-28 12:19:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:43,394 INFO L225 Difference]: With dead ends: 435 [2018-11-28 12:19:43,394 INFO L226 Difference]: Without dead ends: 265 [2018-11-28 12:19:43,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-28 12:19:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-11-28 12:19:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-28 12:19:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2018-11-28 12:19:43,445 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 41 [2018-11-28 12:19:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:43,445 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2018-11-28 12:19:43,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:19:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2018-11-28 12:19:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 12:19:43,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:43,448 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] [2018-11-28 12:19:43,448 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:43,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:43,448 INFO L82 PathProgramCache]: Analyzing trace with hash -623975095, now seen corresponding path program 1 times [2018-11-28 12:19:43,449 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 12:19:43,449 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 12:19:43,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:43,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:43,583 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 12:19:43,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:43,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:43,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:19:43,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:43,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:43,591 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand 3 states. [2018-11-28 12:19:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:43,677 INFO L93 Difference]: Finished difference Result 514 states and 784 transitions. [2018-11-28 12:19:43,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:43,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-28 12:19:43,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:43,680 INFO L225 Difference]: With dead ends: 514 [2018-11-28 12:19:43,680 INFO L226 Difference]: Without dead ends: 387 [2018-11-28 12:19:43,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-28 12:19:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-11-28 12:19:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-28 12:19:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 578 transitions. [2018-11-28 12:19:43,697 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 578 transitions. Word has length 58 [2018-11-28 12:19:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:43,697 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 578 transitions. [2018-11-28 12:19:43,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:19:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 578 transitions. [2018-11-28 12:19:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 12:19:43,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:43,701 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] [2018-11-28 12:19:43,701 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:43,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:43,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1440674399, now seen corresponding path program 1 times [2018-11-28 12:19:43,702 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 12:19:43,702 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 12:19:43,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:43,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 12:19:43,847 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-28 12:19:43,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:43,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:43,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:19:43,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:43,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:43,854 INFO L87 Difference]: Start difference. First operand 387 states and 578 transitions. Second operand 3 states. [2018-11-28 12:19:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:43,979 INFO L93 Difference]: Finished difference Result 758 states and 1147 transitions. [2018-11-28 12:19:43,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:43,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-28 12:19:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:43,982 INFO L225 Difference]: With dead ends: 758 [2018-11-28 12:19:43,982 INFO L226 Difference]: Without dead ends: 509 [2018-11-28 12:19:43,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-11-28 12:19:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-11-28 12:19:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-11-28 12:19:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 760 transitions. [2018-11-28 12:19:44,002 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 760 transitions. Word has length 80 [2018-11-28 12:19:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:44,002 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 760 transitions. [2018-11-28 12:19:44,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:19:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 760 transitions. [2018-11-28 12:19:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 12:19:44,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:44,006 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] [2018-11-28 12:19:44,006 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:44,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1543049171, now seen corresponding path program 1 times [2018-11-28 12:19:44,007 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 12:19:44,008 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 12:19:44,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:44,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-28 12:19:44,166 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 12:19:44,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:44,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:44,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:19:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:44,168 INFO L87 Difference]: Start difference. First operand 509 states and 760 transitions. Second operand 3 states. [2018-11-28 12:19:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:44,283 INFO L93 Difference]: Finished difference Result 1004 states and 1513 transitions. [2018-11-28 12:19:44,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:44,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-28 12:19:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:44,286 INFO L225 Difference]: With dead ends: 1004 [2018-11-28 12:19:44,286 INFO L226 Difference]: Without dead ends: 633 [2018-11-28 12:19:44,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-11-28 12:19:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2018-11-28 12:19:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-11-28 12:19:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 944 transitions. [2018-11-28 12:19:44,302 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 944 transitions. Word has length 104 [2018-11-28 12:19:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:44,302 INFO L480 AbstractCegarLoop]: Abstraction has 633 states and 944 transitions. [2018-11-28 12:19:44,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:19:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 944 transitions. [2018-11-28 12:19:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-28 12:19:44,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:44,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:44,305 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:44,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:44,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2060309453, now seen corresponding path program 1 times [2018-11-28 12:19:44,305 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 12:19:44,306 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 12:19:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:44,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-28 12:19:44,468 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 12:19:44,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:44,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:19:44,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:44,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:44,470 INFO L87 Difference]: Start difference. First operand 633 states and 944 transitions. Second operand 3 states. [2018-11-28 12:19:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:44,569 INFO L93 Difference]: Finished difference Result 1250 states and 1878 transitions. [2018-11-28 12:19:44,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:44,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-28 12:19:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:19:44,572 INFO L225 Difference]: With dead ends: 1250 [2018-11-28 12:19:44,572 INFO L226 Difference]: Without dead ends: 755 [2018-11-28 12:19:44,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-28 12:19:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2018-11-28 12:19:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-11-28 12:19:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1125 transitions. [2018-11-28 12:19:44,591 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1125 transitions. Word has length 121 [2018-11-28 12:19:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:19:44,591 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1125 transitions. [2018-11-28 12:19:44,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:19:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1125 transitions. [2018-11-28 12:19:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-28 12:19:44,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:19:44,593 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:44,593 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:19:44,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash -307755489, now seen corresponding path program 1 times [2018-11-28 12:19:44,594 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 12:19:44,595 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 12:19:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:46,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:46,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:19:46,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-28 12:19:46,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-28 12:19:46,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:46,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 12:19:46,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:46,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:46,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:46,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-28 12:19:46,394 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-28 12:19:46,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-28 12:19:46,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:46,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 12:19:46,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:46,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:46,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:46,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-28 12:19:46,608 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,628 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,640 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,651 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:46,684 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-28 12:19:46,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:46,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:47,312 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:47,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:47,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-28 12:19:47,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:47,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-28 12:19:47,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:47,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:47,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:47,815 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-11-28 12:19:47,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 57 [2018-11-28 12:19:47,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:47,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:47,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:47,952 INFO L303 Elim1Store]: Index analysis took 135 ms [2018-11-28 12:19:47,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-28 12:19:47,953 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,028 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,081 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:19:48,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:19:48,287 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,308 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,366 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:48,375 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:48,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-28 12:19:48,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-28 12:19:48,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-28 12:19:48,453 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,462 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,468 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,480 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:133, output treesize:19 [2018-11-28 12:19:48,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:19:48,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:19:48,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 12:19:48,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 12:19:48,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-28 12:19:48,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:19:48,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:19:48,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 12:19:48,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 12:19:48,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-28 12:19:48,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 12:19:48,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 12:19:48,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:19:48,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:19:48,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 12:19:48,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 12:19:48,952 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,958 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:19:48,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:48,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:19:48,983 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,986 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:48,992 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:95, output treesize:19 [2018-11-28 12:19:49,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:19:49,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:19:49,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 12:19:49,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 12:19:49,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-28 12:19:49,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:19:49,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:19:49,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 12:19:49,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 12:19:49,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-28 12:19:49,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 12:19:49,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 12:19:49,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 12:19:49,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 12:19:49,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,455 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:49,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:49,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-28 12:19:49,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-28 12:19:49,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-28 12:19:49,521 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,531 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,537 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,546 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:95, output treesize:19 [2018-11-28 12:19:49,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-28 12:19:49,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-28 12:19:49,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 132 [2018-11-28 12:19:49,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-28 12:19:49,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:49,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 79 [2018-11-28 12:19:49,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-28 12:19:49,684 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,700 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:148, output treesize:40 [2018-11-28 12:19:49,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-11-28 12:19:49,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-11-28 12:19:49,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 12:19:49,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-28 12:19:49,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-28 12:19:49,753 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,756 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:49,758 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2018-11-28 12:19:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 12:19:49,799 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 12:19:49,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:49,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:19:49,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:19:49,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:19:49,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:19:49,807 INFO L87 Difference]: Start difference. First operand 755 states and 1125 transitions. Second operand 7 states. [2018-11-28 12:20:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:20:05,930 INFO L93 Difference]: Finished difference Result 2698 states and 4049 transitions. [2018-11-28 12:20:05,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:20:05,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-11-28 12:20:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:20:05,937 INFO L225 Difference]: With dead ends: 2698 [2018-11-28 12:20:05,938 INFO L226 Difference]: Without dead ends: 1957 [2018-11-28 12:20:05,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:20:05,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2018-11-28 12:20:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1304. [2018-11-28 12:20:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2018-11-28 12:20:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1967 transitions. [2018-11-28 12:20:05,985 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1967 transitions. Word has length 133 [2018-11-28 12:20:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:20:05,985 INFO L480 AbstractCegarLoop]: Abstraction has 1304 states and 1967 transitions. [2018-11-28 12:20:05,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:20:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1967 transitions. [2018-11-28 12:20:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-28 12:20:05,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:20:05,988 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:05,988 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:20:05,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:05,989 INFO L82 PathProgramCache]: Analyzing trace with hash 721603809, now seen corresponding path program 1 times [2018-11-28 12:20:05,989 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 12:20:05,989 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 12:20:06,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:07,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:07,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:20:07,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:20:07,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:07,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:07,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:07,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 12:20:07,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-28 12:20:07,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:07,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:07,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 12:20:07,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:07,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:07,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:07,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-28 12:20:07,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-28 12:20:07,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:20:07,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 12:20:07,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:20:07,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:07,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:20:07,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-28 12:20:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-28 12:20:07,339 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 12:20:07,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:20:07,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 12:20:07,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:20:07,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:20:07,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:20:07,344 INFO L87 Difference]: Start difference. First operand 1304 states and 1967 transitions. Second operand 8 states. [2018-11-28 12:20:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:20:18,113 INFO L93 Difference]: Finished difference Result 3700 states and 5591 transitions. [2018-11-28 12:20:18,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:20:18,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2018-11-28 12:20:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:20:18,120 INFO L225 Difference]: With dead ends: 3700 [2018-11-28 12:20:18,120 INFO L226 Difference]: Without dead ends: 2410 [2018-11-28 12:20:18,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:20:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2018-11-28 12:20:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 1588. [2018-11-28 12:20:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-11-28 12:20:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2449 transitions. [2018-11-28 12:20:18,162 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2449 transitions. Word has length 133 [2018-11-28 12:20:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:20:18,162 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2449 transitions. [2018-11-28 12:20:18,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:20:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2449 transitions. [2018-11-28 12:20:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-28 12:20:18,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:20:18,164 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:18,164 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:20:18,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1236970977, now seen corresponding path program 1 times [2018-11-28 12:20:18,165 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 12:20:18,165 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 12:20:18,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:21,363 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 12:20:21,409 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 12:20:21,409 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 12:20:21,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:21 BoogieIcfgContainer [2018-11-28 12:20:21,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:20:21,466 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:20:21,466 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:20:21,466 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:20:21,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:19:42" (3/4) ... [2018-11-28 12:20:21,468 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 12:20:21,483 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 12:20:21,484 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 12:20:21,564 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f8620b2-d203-492b-8fbc-0093034f88c7/bin-2019/uautomizer/witness.graphml [2018-11-28 12:20:21,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:20:21,565 INFO L168 Benchmark]: Toolchain (without parser) took 41842.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.7 MB). Free memory was 938.0 MB in the beginning and 872.0 MB in the end (delta: 66.1 MB). Peak memory consumption was 350.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:21,566 INFO L168 Benchmark]: CDTParser took 0.13 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-11-28 12:20:21,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:21,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:20:21,567 INFO L168 Benchmark]: Boogie Preprocessor took 65.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:21,567 INFO L168 Benchmark]: RCFGBuilder took 2659.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:21,567 INFO L168 Benchmark]: TraceAbstraction took 38495.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.0 GB in the beginning and 889.4 MB in the end (delta: 135.5 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:21,567 INFO L168 Benchmark]: Witness Printer took 98.84 ms. Allocated memory is still 1.3 GB. Free memory was 889.4 MB in the beginning and 872.0 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:21,569 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.13 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 485.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2659.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38495.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.0 GB in the beginning and 889.4 MB in the end (delta: 135.5 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. * Witness Printer took 98.84 ms. Allocated memory is still 1.3 GB. Free memory was 889.4 MB in the beginning and 872.0 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: - CounterExampleResult [Line: 1726]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=0, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={130: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)) VAL [init=1, malloc(sizeof(SSL))={129:0}, malloc(sizeof(SSL_CTX))={3:0}, malloc(sizeof(SSL_SESSION))={2:0}, malloc(sizeof(struct ssl3_state_st))={524418:0}, s={129:0}, SSLv3_server_data={130:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={129:0}, SSLv3_server_data={130:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [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=4294967295, s={129:0}, s={129:0}, s->info_callback={1:0}, skip=0, SSLv3_server_data={130:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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 [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] EXPR s->cert VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->cert={0:1}, skip=0, SSLv3_server_data={130:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->state=8464, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->state=8464, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->state=8464, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->state=8464, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->state=8464, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->state=8464, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->state=8464, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->state=8464, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={1:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={129:0}, s={129:0}, s->state=8464, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={1:0}, blastFlag=1, got_new_session=0, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->s3={524418:0}, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={1:0}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8496, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->hit=0, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1357] s->init_num = 0 VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->s3={524418:0}, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={1:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8512, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={524418:52}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->s3={524418:0}, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1370] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->s3={524418:0}, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={129:0}, s={129:0}, s->state=8528, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options VAL [={1:0}, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->options=2097152, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp VAL [={1:0}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->s3={524418:0}, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1411] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=1, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->s3={524418:0}, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->state=8544, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->verify_mode=1, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [={1:0}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->session={2:0}, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={524418:52}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={129:0}, s={129:0}, s->s3={524418:0}, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 7 VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=0, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1726] __VERIFIER_error() VAL [={1:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=0, s={129:0}, s={129:0}, skip=0, SSLv3_server_data={130:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 1 error locations. UNSAFE Result, 38.4s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 27.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2182 SDtfs, 1856 SDslu, 2288 SDs, 0 SdLazy, 1629 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1588occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 1475 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 803 NumberOfCodeBlocks, 803 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 663 ConstructedInterpolants, 0 QuantifiedInterpolants, 379139 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2269 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 534/534 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...