./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 ........................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:05:19,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:05:19,627 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:05:19,633 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:05:19,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:05:19,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:05:19,634 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:05:19,635 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:05:19,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:05:19,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:05:19,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:05:19,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:05:19,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:05:19,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:05:19,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:05:19,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:05:19,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:05:19,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:05:19,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:05:19,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:05:19,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:05:19,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:05:19,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:05:19,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:05:19,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:05:19,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:05:19,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:05:19,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:05:19,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:05:19,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:05:19,648 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:05:19,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:05:19,649 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:05:19,649 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:05:19,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:05:19,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:05:19,650 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:05:19,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:05:19,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:05:19,658 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:05:19,658 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:05:19,658 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:05:19,658 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:05:19,658 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:05:19,658 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:05:19,659 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:05:19,659 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:05:19,659 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:05:19,659 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:05:19,659 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:05:19,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:05:19,660 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:05:19,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:05:19,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:05:19,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:05:19,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:05:19,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:05:19,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:05:19,660 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:05:19,661 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:05:19,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:05:19,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:05:19,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:05:19,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:05:19,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:05:19,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:05:19,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:05:19,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:05:19,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:05:19,662 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:05:19,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:05:19,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:05:19,662 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:05:19,662 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 [2018-12-09 12:05:19,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:05:19,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:05:19,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:05:19,689 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:05:19,689 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:05:19,690 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-09 12:05:19,725 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data/aab3cb130/08233d8d5f99450cb63cfc2289f55ee1/FLAG84ca6fad7 [2018-12-09 12:05:20,232 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:05:20,232 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-09 12:05:20,241 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data/aab3cb130/08233d8d5f99450cb63cfc2289f55ee1/FLAG84ca6fad7 [2018-12-09 12:05:20,250 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data/aab3cb130/08233d8d5f99450cb63cfc2289f55ee1 [2018-12-09 12:05:20,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:05:20,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:05:20,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:05:20,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:05:20,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:05:20,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fde7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20, skipping insertion in model container [2018-12-09 12:05:20,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:05:20,289 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:05:20,533 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:05:20,541 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:05:20,593 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:05:20,604 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:05:20,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20 WrapperNode [2018-12-09 12:05:20,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:05:20,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:05:20,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:05:20,606 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:05:20,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:05:20,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:05:20,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:05:20,629 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:05:20,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... [2018-12-09 12:05:20,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:05:20,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:05:20,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:05:20,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:05:20,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:05:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 12:05:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 12:05:20,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 12:05:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 12:05:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:05:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:05:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 12:05:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 12:05:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 12:05:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-09 12:05:20,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-09 12:05:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 12:05:20,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 12:05:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:05:20,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:05:20,887 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 12:05:20,887 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 12:05:21,235 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:05:21,235 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 12:05:21,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:05:21 BoogieIcfgContainer [2018-12-09 12:05:21,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:05:21,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:05:21,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:05:21,239 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:05:21,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:05:20" (1/3) ... [2018-12-09 12:05:21,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60159274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:05:21, skipping insertion in model container [2018-12-09 12:05:21,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:20" (2/3) ... [2018-12-09 12:05:21,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60159274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:05:21, skipping insertion in model container [2018-12-09 12:05:21,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:05:21" (3/3) ... [2018-12-09 12:05:21,242 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-09 12:05:21,248 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:05:21,253 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 12:05:21,262 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 12:05:21,280 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:05:21,280 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:05:21,280 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:05:21,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:05:21,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:05:21,280 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:05:21,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:05:21,281 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:05:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-12-09 12:05:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 12:05:21,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:21,298 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-12-09 12:05:21,299 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:21,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash -995657757, now seen corresponding path program 1 times [2018-12-09 12:05:21,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:21,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:21,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:21,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:21,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:21,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:21,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:21,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:21,501 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2018-12-09 12:05:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:21,761 INFO L93 Difference]: Finished difference Result 333 states and 558 transitions. [2018-12-09 12:05:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:21,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-09 12:05:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:21,769 INFO L225 Difference]: With dead ends: 333 [2018-12-09 12:05:21,769 INFO L226 Difference]: Without dead ends: 169 [2018-12-09 12:05:21,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-09 12:05:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-09 12:05:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 12:05:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2018-12-09 12:05:21,801 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2018-12-09 12:05:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:21,802 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2018-12-09 12:05:21,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2018-12-09 12:05:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 12:05:21,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:21,803 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-12-09 12:05:21,803 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:21,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1978591950, now seen corresponding path program 1 times [2018-12-09 12:05:21,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:21,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:21,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:21,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:21,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:21,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:21,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:21,877 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:21,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:21,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:21,878 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2018-12-09 12:05:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:22,070 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2018-12-09 12:05:22,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:22,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 12:05:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:22,071 INFO L225 Difference]: With dead ends: 296 [2018-12-09 12:05:22,071 INFO L226 Difference]: Without dead ends: 169 [2018-12-09 12:05:22,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-09 12:05:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-09 12:05:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 12:05:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2018-12-09 12:05:22,080 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2018-12-09 12:05:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:22,081 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2018-12-09 12:05:22,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2018-12-09 12:05:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 12:05:22,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:22,082 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-12-09 12:05:22,082 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:22,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:22,082 INFO L82 PathProgramCache]: Analyzing trace with hash -659098542, now seen corresponding path program 1 times [2018-12-09 12:05:22,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:22,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:22,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:22,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:22,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:22,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:22,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:05:22,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:22,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:05:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:05:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:22,162 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 5 states. [2018-12-09 12:05:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:22,438 INFO L93 Difference]: Finished difference Result 300 states and 457 transitions. [2018-12-09 12:05:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:05:22,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-09 12:05:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:22,439 INFO L225 Difference]: With dead ends: 300 [2018-12-09 12:05:22,440 INFO L226 Difference]: Without dead ends: 173 [2018-12-09 12:05:22,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:05:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-09 12:05:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-09 12:05:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 12:05:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2018-12-09 12:05:22,446 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2018-12-09 12:05:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:22,446 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2018-12-09 12:05:22,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:05:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2018-12-09 12:05:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 12:05:22,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:22,447 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-12-09 12:05:22,448 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:22,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1162543817, now seen corresponding path program 1 times [2018-12-09 12:05:22,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:22,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:22,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:22,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:22,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:22,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:22,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:22,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:22,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:22,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:22,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:22,491 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2018-12-09 12:05:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:22,653 INFO L93 Difference]: Finished difference Result 333 states and 497 transitions. [2018-12-09 12:05:22,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:22,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 12:05:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:22,654 INFO L225 Difference]: With dead ends: 333 [2018-12-09 12:05:22,654 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 12:05:22,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 12:05:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-12-09 12:05:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 12:05:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2018-12-09 12:05:22,664 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2018-12-09 12:05:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:22,664 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2018-12-09 12:05:22,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2018-12-09 12:05:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 12:05:22,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:22,665 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-12-09 12:05:22,666 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:22,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash -480987638, now seen corresponding path program 1 times [2018-12-09 12:05:22,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:22,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:22,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:22,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:22,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:22,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:22,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:22,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:22,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:22,713 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2018-12-09 12:05:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:22,850 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2018-12-09 12:05:22,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:22,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 12:05:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:22,851 INFO L225 Difference]: With dead ends: 332 [2018-12-09 12:05:22,851 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 12:05:22,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 12:05:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-09 12:05:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 12:05:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2018-12-09 12:05:22,859 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2018-12-09 12:05:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:22,859 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2018-12-09 12:05:22,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:22,860 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2018-12-09 12:05:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 12:05:22,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:22,860 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-12-09 12:05:22,861 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:22,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:22,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2014271313, now seen corresponding path program 1 times [2018-12-09 12:05:22,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:22,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:22,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:22,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:22,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:22,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:22,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:22,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:22,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:22,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:22,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:22,920 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2018-12-09 12:05:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:23,077 INFO L93 Difference]: Finished difference Result 332 states and 494 transitions. [2018-12-09 12:05:23,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:23,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 12:05:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:23,079 INFO L225 Difference]: With dead ends: 332 [2018-12-09 12:05:23,079 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 12:05:23,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 12:05:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-09 12:05:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 12:05:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2018-12-09 12:05:23,085 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2018-12-09 12:05:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:23,085 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2018-12-09 12:05:23,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2018-12-09 12:05:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 12:05:23,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:23,086 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-12-09 12:05:23,086 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:23,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash -515871290, now seen corresponding path program 1 times [2018-12-09 12:05:23,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:23,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:23,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:23,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:23,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:23,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:23,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:23,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:23,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:23,136 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2018-12-09 12:05:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:23,275 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2018-12-09 12:05:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:23,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-09 12:05:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:23,276 INFO L225 Difference]: With dead ends: 332 [2018-12-09 12:05:23,276 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 12:05:23,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 12:05:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-09 12:05:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 12:05:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2018-12-09 12:05:23,280 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2018-12-09 12:05:23,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:23,280 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2018-12-09 12:05:23,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2018-12-09 12:05:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 12:05:23,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:23,281 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-12-09 12:05:23,281 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:23,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash -623975095, now seen corresponding path program 1 times [2018-12-09 12:05:23,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:23,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:23,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:23,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:23,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:23,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:23,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:23,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:23,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:23,311 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2018-12-09 12:05:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:23,457 INFO L93 Difference]: Finished difference Result 361 states and 539 transitions. [2018-12-09 12:05:23,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:23,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 12:05:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:23,459 INFO L225 Difference]: With dead ends: 361 [2018-12-09 12:05:23,459 INFO L226 Difference]: Without dead ends: 214 [2018-12-09 12:05:23,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-09 12:05:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-09 12:05:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2018-12-09 12:05:23,463 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 58 [2018-12-09 12:05:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:23,464 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2018-12-09 12:05:23,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2018-12-09 12:05:23,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 12:05:23,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:23,464 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-12-09 12:05:23,465 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:23,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:23,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1702821866, now seen corresponding path program 1 times [2018-12-09 12:05:23,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:23,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:23,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:23,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:23,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:23,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:23,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:23,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:23,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:23,504 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 4 states. [2018-12-09 12:05:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:23,635 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2018-12-09 12:05:23,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:23,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 12:05:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:23,637 INFO L225 Difference]: With dead ends: 376 [2018-12-09 12:05:23,637 INFO L226 Difference]: Without dead ends: 207 [2018-12-09 12:05:23,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-09 12:05:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-12-09 12:05:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2018-12-09 12:05:23,642 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2018-12-09 12:05:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:23,642 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2018-12-09 12:05:23,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2018-12-09 12:05:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 12:05:23,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:23,643 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-12-09 12:05:23,643 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:23,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash 480798369, now seen corresponding path program 1 times [2018-12-09 12:05:23,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:23,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:23,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:23,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:23,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:23,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:23,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:23,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:23,680 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2018-12-09 12:05:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:23,808 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2018-12-09 12:05:23,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:23,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 12:05:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:23,809 INFO L225 Difference]: With dead ends: 366 [2018-12-09 12:05:23,809 INFO L226 Difference]: Without dead ends: 197 [2018-12-09 12:05:23,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-09 12:05:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-12-09 12:05:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2018-12-09 12:05:23,816 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2018-12-09 12:05:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:23,816 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2018-12-09 12:05:23,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2018-12-09 12:05:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 12:05:23,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:23,817 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-12-09 12:05:23,817 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:23,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1484856716, now seen corresponding path program 1 times [2018-12-09 12:05:23,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:23,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:23,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:23,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:23,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:23,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:23,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:23,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:23,863 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2018-12-09 12:05:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:24,035 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2018-12-09 12:05:24,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:24,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-09 12:05:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:24,036 INFO L225 Difference]: With dead ends: 383 [2018-12-09 12:05:24,036 INFO L226 Difference]: Without dead ends: 214 [2018-12-09 12:05:24,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-09 12:05:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-09 12:05:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2018-12-09 12:05:24,041 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2018-12-09 12:05:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:24,042 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2018-12-09 12:05:24,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2018-12-09 12:05:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 12:05:24,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:24,042 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-12-09 12:05:24,043 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:24,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1155270063, now seen corresponding path program 1 times [2018-12-09 12:05:24,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:24,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:24,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:24,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:24,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:24,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:24,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:24,089 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2018-12-09 12:05:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:24,271 INFO L93 Difference]: Finished difference Result 381 states and 569 transitions. [2018-12-09 12:05:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:24,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 12:05:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:24,272 INFO L225 Difference]: With dead ends: 381 [2018-12-09 12:05:24,272 INFO L226 Difference]: Without dead ends: 212 [2018-12-09 12:05:24,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-09 12:05:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-12-09 12:05:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2018-12-09 12:05:24,276 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2018-12-09 12:05:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:24,276 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2018-12-09 12:05:24,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2018-12-09 12:05:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 12:05:24,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:24,277 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-12-09 12:05:24,277 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:24,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash -488261392, now seen corresponding path program 1 times [2018-12-09 12:05:24,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:24,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:24,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:24,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:24,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:24,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:24,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:24,307 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2018-12-09 12:05:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:24,491 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-09 12:05:24,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:24,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 12:05:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:24,492 INFO L225 Difference]: With dead ends: 380 [2018-12-09 12:05:24,492 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 12:05:24,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 12:05:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 12:05:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2018-12-09 12:05:24,497 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2018-12-09 12:05:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:24,497 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2018-12-09 12:05:24,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2018-12-09 12:05:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 12:05:24,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:24,498 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-12-09 12:05:24,498 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:24,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2055209609, now seen corresponding path program 1 times [2018-12-09 12:05:24,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:24,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:24,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:24,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:24,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:24,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:24,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:24,547 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2018-12-09 12:05:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:24,723 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-12-09 12:05:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:24,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-09 12:05:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:24,724 INFO L225 Difference]: With dead ends: 380 [2018-12-09 12:05:24,724 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 12:05:24,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 12:05:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 12:05:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-12-09 12:05:24,730 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2018-12-09 12:05:24,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:24,731 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-12-09 12:05:24,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-12-09 12:05:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 12:05:24,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:24,731 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-12-09 12:05:24,732 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:24,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:24,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1083985708, now seen corresponding path program 1 times [2018-12-09 12:05:24,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:24,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:24,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:24,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:24,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:24,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:24,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:24,789 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2018-12-09 12:05:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:24,967 INFO L93 Difference]: Finished difference Result 380 states and 562 transitions. [2018-12-09 12:05:24,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:24,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-09 12:05:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:24,969 INFO L225 Difference]: With dead ends: 380 [2018-12-09 12:05:24,969 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 12:05:24,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 12:05:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 12:05:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-12-09 12:05:24,976 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2018-12-09 12:05:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:24,977 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-12-09 12:05:24,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-12-09 12:05:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 12:05:24,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:24,978 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-12-09 12:05:24,978 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:24,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:24,978 INFO L82 PathProgramCache]: Analyzing trace with hash -241218748, now seen corresponding path program 1 times [2018-12-09 12:05:24,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:24,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:24,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:24,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:25,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:25,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:25,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:25,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:25,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:25,021 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2018-12-09 12:05:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:25,183 INFO L93 Difference]: Finished difference Result 380 states and 560 transitions. [2018-12-09 12:05:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:25,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-09 12:05:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:25,184 INFO L225 Difference]: With dead ends: 380 [2018-12-09 12:05:25,184 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 12:05:25,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 12:05:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 12:05:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2018-12-09 12:05:25,188 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2018-12-09 12:05:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:25,189 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2018-12-09 12:05:25,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2018-12-09 12:05:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 12:05:25,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:25,189 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-12-09 12:05:25,189 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:25,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:25,189 INFO L82 PathProgramCache]: Analyzing trace with hash 345081479, now seen corresponding path program 1 times [2018-12-09 12:05:25,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:25,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:25,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:25,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:25,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:05:25,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:25,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:25,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:25,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:25,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:25,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:25,233 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2018-12-09 12:05:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:25,375 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-09 12:05:25,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:25,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 12:05:25,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:25,376 INFO L225 Difference]: With dead ends: 370 [2018-12-09 12:05:25,376 INFO L226 Difference]: Without dead ends: 201 [2018-12-09 12:05:25,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-09 12:05:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-12-09 12:05:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 12:05:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-12-09 12:05:25,380 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2018-12-09 12:05:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:25,380 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-12-09 12:05:25,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:25,381 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-12-09 12:05:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 12:05:25,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:25,381 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-12-09 12:05:25,381 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:25,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1440674399, now seen corresponding path program 1 times [2018-12-09 12:05:25,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:25,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:25,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:25,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:25,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:25,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:25,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:25,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:25,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:25,426 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2018-12-09 12:05:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:25,657 INFO L93 Difference]: Finished difference Result 469 states and 696 transitions. [2018-12-09 12:05:25,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:25,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 12:05:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:25,658 INFO L225 Difference]: With dead ends: 469 [2018-12-09 12:05:25,658 INFO L226 Difference]: Without dead ends: 300 [2018-12-09 12:05:25,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-09 12:05:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2018-12-09 12:05:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-09 12:05:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2018-12-09 12:05:25,664 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2018-12-09 12:05:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:25,664 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2018-12-09 12:05:25,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2018-12-09 12:05:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 12:05:25,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:25,665 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-12-09 12:05:25,665 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:25,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1368287841, now seen corresponding path program 1 times [2018-12-09 12:05:25,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:25,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:25,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:25,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:25,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:25,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:25,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:25,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:25,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:25,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:25,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:25,713 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2018-12-09 12:05:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:25,893 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-12-09 12:05:25,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:25,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 12:05:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:25,894 INFO L225 Difference]: With dead ends: 472 [2018-12-09 12:05:25,894 INFO L226 Difference]: Without dead ends: 273 [2018-12-09 12:05:25,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:25,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-12-09 12:05:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2018-12-09 12:05:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-09 12:05:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2018-12-09 12:05:25,900 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2018-12-09 12:05:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:25,901 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2018-12-09 12:05:25,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2018-12-09 12:05:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:05:25,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:25,901 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-12-09 12:05:25,901 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:25,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:25,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2002550352, now seen corresponding path program 1 times [2018-12-09 12:05:25,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:25,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:25,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:25,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:25,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:25,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:25,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:25,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:25,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:25,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:25,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:25,952 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2018-12-09 12:05:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:26,170 INFO L93 Difference]: Finished difference Result 539 states and 815 transitions. [2018-12-09 12:05:26,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:26,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 12:05:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:26,171 INFO L225 Difference]: With dead ends: 539 [2018-12-09 12:05:26,171 INFO L226 Difference]: Without dead ends: 316 [2018-12-09 12:05:26,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-09 12:05:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2018-12-09 12:05:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-09 12:05:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2018-12-09 12:05:26,176 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2018-12-09 12:05:26,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:26,176 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2018-12-09 12:05:26,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2018-12-09 12:05:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 12:05:26,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:26,177 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-12-09 12:05:26,177 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:26,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash 323004382, now seen corresponding path program 1 times [2018-12-09 12:05:26,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:26,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:26,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:26,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:26,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:26,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:26,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:26,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:26,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:26,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:26,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:26,216 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2018-12-09 12:05:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:26,418 INFO L93 Difference]: Finished difference Result 540 states and 815 transitions. [2018-12-09 12:05:26,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:26,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-09 12:05:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:26,419 INFO L225 Difference]: With dead ends: 540 [2018-12-09 12:05:26,419 INFO L226 Difference]: Without dead ends: 316 [2018-12-09 12:05:26,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-09 12:05:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2018-12-09 12:05:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-09 12:05:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2018-12-09 12:05:26,426 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 87 [2018-12-09 12:05:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:26,426 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2018-12-09 12:05:26,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2018-12-09 12:05:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 12:05:26,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:26,427 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-12-09 12:05:26,427 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:26,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:26,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1206018514, now seen corresponding path program 1 times [2018-12-09 12:05:26,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:26,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:26,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:26,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:26,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:26,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:26,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:26,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:26,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:26,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:26,464 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2018-12-09 12:05:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:26,662 INFO L93 Difference]: Finished difference Result 542 states and 822 transitions. [2018-12-09 12:05:26,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:26,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-09 12:05:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:26,663 INFO L225 Difference]: With dead ends: 542 [2018-12-09 12:05:26,663 INFO L226 Difference]: Without dead ends: 308 [2018-12-09 12:05:26,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-09 12:05:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-09 12:05:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-12-09 12:05:26,672 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 88 [2018-12-09 12:05:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:26,672 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-12-09 12:05:26,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-12-09 12:05:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 12:05:26,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:26,673 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-12-09 12:05:26,674 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:26,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:26,674 INFO L82 PathProgramCache]: Analyzing trace with hash 62751798, now seen corresponding path program 1 times [2018-12-09 12:05:26,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:26,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:26,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:26,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:26,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:26,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:26,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:26,719 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2018-12-09 12:05:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:26,946 INFO L93 Difference]: Finished difference Result 543 states and 822 transitions. [2018-12-09 12:05:26,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:26,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-09 12:05:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:26,947 INFO L225 Difference]: With dead ends: 543 [2018-12-09 12:05:26,947 INFO L226 Difference]: Without dead ends: 308 [2018-12-09 12:05:26,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-09 12:05:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-09 12:05:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2018-12-09 12:05:26,953 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2018-12-09 12:05:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:26,953 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2018-12-09 12:05:26,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2018-12-09 12:05:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 12:05:26,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:26,954 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-12-09 12:05:26,954 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:26,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:26,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1991024500, now seen corresponding path program 1 times [2018-12-09 12:05:26,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:26,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:26,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:26,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:26,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:26,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:26,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:26,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:26,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:26,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:26,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:26,997 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2018-12-09 12:05:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:27,171 INFO L93 Difference]: Finished difference Result 520 states and 790 transitions. [2018-12-09 12:05:27,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:27,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-09 12:05:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:27,172 INFO L225 Difference]: With dead ends: 520 [2018-12-09 12:05:27,172 INFO L226 Difference]: Without dead ends: 285 [2018-12-09 12:05:27,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-09 12:05:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2018-12-09 12:05:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2018-12-09 12:05:27,179 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2018-12-09 12:05:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:27,179 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2018-12-09 12:05:27,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2018-12-09 12:05:27,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:05:27,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:27,179 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-12-09 12:05:27,179 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:27,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash 19690565, now seen corresponding path program 1 times [2018-12-09 12:05:27,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:27,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:27,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:27,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:27,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:27,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:27,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:27,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:27,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:27,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:27,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:27,228 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2018-12-09 12:05:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:27,426 INFO L93 Difference]: Finished difference Result 541 states and 816 transitions. [2018-12-09 12:05:27,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:27,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 12:05:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:27,427 INFO L225 Difference]: With dead ends: 541 [2018-12-09 12:05:27,427 INFO L226 Difference]: Without dead ends: 306 [2018-12-09 12:05:27,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:27,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-09 12:05:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 260. [2018-12-09 12:05:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2018-12-09 12:05:27,433 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2018-12-09 12:05:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:27,433 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2018-12-09 12:05:27,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2018-12-09 12:05:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:05:27,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:27,434 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-12-09 12:05:27,434 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:27,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1623840890, now seen corresponding path program 1 times [2018-12-09 12:05:27,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:27,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:27,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:27,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:27,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:27,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:27,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:27,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:27,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:27,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:27,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:27,468 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2018-12-09 12:05:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:27,663 INFO L93 Difference]: Finished difference Result 540 states and 813 transitions. [2018-12-09 12:05:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:27,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 12:05:27,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:27,664 INFO L225 Difference]: With dead ends: 540 [2018-12-09 12:05:27,664 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 12:05:27,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 12:05:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-09 12:05:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2018-12-09 12:05:27,673 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2018-12-09 12:05:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:27,673 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2018-12-09 12:05:27,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2018-12-09 12:05:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:05:27,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:27,674 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-12-09 12:05:27,674 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:27,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -333397817, now seen corresponding path program 1 times [2018-12-09 12:05:27,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:27,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:27,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:27,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:27,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:27,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:27,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:27,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:27,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:27,732 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2018-12-09 12:05:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:27,893 INFO L93 Difference]: Finished difference Result 518 states and 782 transitions. [2018-12-09 12:05:27,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:27,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 12:05:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:27,894 INFO L225 Difference]: With dead ends: 518 [2018-12-09 12:05:27,894 INFO L226 Difference]: Without dead ends: 283 [2018-12-09 12:05:27,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-09 12:05:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2018-12-09 12:05:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2018-12-09 12:05:27,900 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2018-12-09 12:05:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:27,900 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2018-12-09 12:05:27,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2018-12-09 12:05:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:05:27,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:27,901 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-12-09 12:05:27,901 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:27,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:27,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1976929272, now seen corresponding path program 1 times [2018-12-09 12:05:27,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:27,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:27,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:27,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:27,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:27,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:27,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:27,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:27,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:27,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:27,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:27,931 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2018-12-09 12:05:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:28,070 INFO L93 Difference]: Finished difference Result 517 states and 779 transitions. [2018-12-09 12:05:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:28,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 12:05:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:28,071 INFO L225 Difference]: With dead ends: 517 [2018-12-09 12:05:28,071 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 12:05:28,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 12:05:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 12:05:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2018-12-09 12:05:28,077 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2018-12-09 12:05:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:28,077 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2018-12-09 12:05:28,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2018-12-09 12:05:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:05:28,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:28,077 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-12-09 12:05:28,077 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:28,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1211983539, now seen corresponding path program 1 times [2018-12-09 12:05:28,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:28,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:28,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:28,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:28,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:28,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:28,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:28,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:28,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:28,117 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2018-12-09 12:05:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:28,304 INFO L93 Difference]: Finished difference Result 540 states and 807 transitions. [2018-12-09 12:05:28,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:28,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-09 12:05:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:28,305 INFO L225 Difference]: With dead ends: 540 [2018-12-09 12:05:28,305 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 12:05:28,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 12:05:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-09 12:05:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2018-12-09 12:05:28,311 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2018-12-09 12:05:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:28,311 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2018-12-09 12:05:28,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2018-12-09 12:05:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 12:05:28,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:28,312 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-12-09 12:05:28,312 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:28,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1143821711, now seen corresponding path program 1 times [2018-12-09 12:05:28,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:28,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:28,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:28,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:28,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:28,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:28,336 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2018-12-09 12:05:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:28,493 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-12-09 12:05:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:28,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-09 12:05:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:28,494 INFO L225 Difference]: With dead ends: 517 [2018-12-09 12:05:28,494 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 12:05:28,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 12:05:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 12:05:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2018-12-09 12:05:28,504 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2018-12-09 12:05:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:28,505 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2018-12-09 12:05:28,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2018-12-09 12:05:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:05:28,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:28,505 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-12-09 12:05:28,506 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:28,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:28,506 INFO L82 PathProgramCache]: Analyzing trace with hash 713781314, now seen corresponding path program 1 times [2018-12-09 12:05:28,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:28,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:28,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:28,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:28,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:28,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:28,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:28,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:28,554 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2018-12-09 12:05:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:28,777 INFO L93 Difference]: Finished difference Result 540 states and 803 transitions. [2018-12-09 12:05:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:28,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-09 12:05:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:28,778 INFO L225 Difference]: With dead ends: 540 [2018-12-09 12:05:28,778 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 12:05:28,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 12:05:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-09 12:05:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2018-12-09 12:05:28,784 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2018-12-09 12:05:28,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:28,785 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2018-12-09 12:05:28,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2018-12-09 12:05:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:05:28,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:28,785 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-12-09 12:05:28,785 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:28,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:28,786 INFO L82 PathProgramCache]: Analyzing trace with hash 698262596, now seen corresponding path program 1 times [2018-12-09 12:05:28,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:28,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:28,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:28,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:28,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:28,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:28,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:28,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:28,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:28,818 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2018-12-09 12:05:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:28,969 INFO L93 Difference]: Finished difference Result 517 states and 771 transitions. [2018-12-09 12:05:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:28,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-09 12:05:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:28,970 INFO L225 Difference]: With dead ends: 517 [2018-12-09 12:05:28,970 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 12:05:28,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 12:05:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 12:05:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2018-12-09 12:05:28,978 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2018-12-09 12:05:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:28,978 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2018-12-09 12:05:28,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2018-12-09 12:05:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 12:05:28,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:28,979 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-12-09 12:05:28,979 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:28,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1167346926, now seen corresponding path program 1 times [2018-12-09 12:05:28,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:28,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:28,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:28,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:29,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:29,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:29,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:29,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:29,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:29,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:29,020 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2018-12-09 12:05:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:29,207 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2018-12-09 12:05:29,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:29,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-09 12:05:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:29,208 INFO L225 Difference]: With dead ends: 540 [2018-12-09 12:05:29,208 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 12:05:29,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 12:05:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-09 12:05:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2018-12-09 12:05:29,220 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2018-12-09 12:05:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:29,220 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2018-12-09 12:05:29,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2018-12-09 12:05:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 12:05:29,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:29,220 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-12-09 12:05:29,220 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:29,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 686266668, now seen corresponding path program 1 times [2018-12-09 12:05:29,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:29,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:29,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:29,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:29,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:29,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:29,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:29,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:29,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:29,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:29,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:29,252 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2018-12-09 12:05:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:29,419 INFO L93 Difference]: Finished difference Result 517 states and 767 transitions. [2018-12-09 12:05:29,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:29,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-09 12:05:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:29,420 INFO L225 Difference]: With dead ends: 517 [2018-12-09 12:05:29,420 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 12:05:29,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 12:05:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 12:05:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2018-12-09 12:05:29,427 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2018-12-09 12:05:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:29,427 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2018-12-09 12:05:29,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2018-12-09 12:05:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 12:05:29,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:29,428 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-12-09 12:05:29,428 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:29,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:29,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1060944413, now seen corresponding path program 1 times [2018-12-09 12:05:29,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:29,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:29,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:29,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:29,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:29,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:29,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:29,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:29,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:29,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:29,459 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2018-12-09 12:05:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:29,631 INFO L93 Difference]: Finished difference Result 530 states and 783 transitions. [2018-12-09 12:05:29,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:29,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 12:05:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:29,632 INFO L225 Difference]: With dead ends: 530 [2018-12-09 12:05:29,632 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 12:05:29,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 12:05:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-12-09 12:05:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2018-12-09 12:05:29,640 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2018-12-09 12:05:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:29,640 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2018-12-09 12:05:29,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2018-12-09 12:05:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 12:05:29,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:29,641 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-12-09 12:05:29,641 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:29,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:29,641 INFO L82 PathProgramCache]: Analyzing trace with hash -967641697, now seen corresponding path program 1 times [2018-12-09 12:05:29,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:29,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:29,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:29,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:29,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:29,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:29,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:29,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:29,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:29,671 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2018-12-09 12:05:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:29,821 INFO L93 Difference]: Finished difference Result 507 states and 751 transitions. [2018-12-09 12:05:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:29,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 12:05:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:29,823 INFO L225 Difference]: With dead ends: 507 [2018-12-09 12:05:29,823 INFO L226 Difference]: Without dead ends: 272 [2018-12-09 12:05:29,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-09 12:05:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2018-12-09 12:05:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2018-12-09 12:05:29,833 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2018-12-09 12:05:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:29,833 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2018-12-09 12:05:29,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2018-12-09 12:05:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 12:05:29,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:29,834 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-12-09 12:05:29,834 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:29,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:29,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1531434557, now seen corresponding path program 1 times [2018-12-09 12:05:29,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:29,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:29,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:29,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:29,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 12:05:29,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:29,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:29,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:29,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:29,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:29,869 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2018-12-09 12:05:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:30,057 INFO L93 Difference]: Finished difference Result 530 states and 779 transitions. [2018-12-09 12:05:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:30,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-09 12:05:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:30,058 INFO L225 Difference]: With dead ends: 530 [2018-12-09 12:05:30,059 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 12:05:30,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:05:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 12:05:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-12-09 12:05:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 12:05:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2018-12-09 12:05:30,068 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2018-12-09 12:05:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:30,068 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2018-12-09 12:05:30,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2018-12-09 12:05:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 12:05:30,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:30,069 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-12-09 12:05:30,069 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:30,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:30,069 INFO L82 PathProgramCache]: Analyzing trace with hash -144649147, now seen corresponding path program 1 times [2018-12-09 12:05:30,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:30,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:30,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 12:05:30,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:30,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:05:30,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:30,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:05:30,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:05:30,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:05:30,098 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2018-12-09 12:05:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:30,144 INFO L93 Difference]: Finished difference Result 728 states and 1080 transitions. [2018-12-09 12:05:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:05:30,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-09 12:05:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:30,145 INFO L225 Difference]: With dead ends: 728 [2018-12-09 12:05:30,145 INFO L226 Difference]: Without dead ends: 493 [2018-12-09 12:05:30,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:05:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-12-09 12:05:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-12-09 12:05:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-12-09 12:05:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2018-12-09 12:05:30,158 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2018-12-09 12:05:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:30,158 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2018-12-09 12:05:30,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:05:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2018-12-09 12:05:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 12:05:30,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:30,159 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-12-09 12:05:30,159 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:30,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:30,159 INFO L82 PathProgramCache]: Analyzing trace with hash -282131921, now seen corresponding path program 1 times [2018-12-09 12:05:30,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:30,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:30,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 12:05:30,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:30,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:05:30,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:30,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:05:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:05:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:05:30,182 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2018-12-09 12:05:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:30,221 INFO L93 Difference]: Finished difference Result 1196 states and 1769 transitions. [2018-12-09 12:05:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:05:30,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-09 12:05:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:30,222 INFO L225 Difference]: With dead ends: 1196 [2018-12-09 12:05:30,222 INFO L226 Difference]: Without dead ends: 728 [2018-12-09 12:05:30,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:05:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-09 12:05:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-12-09 12:05:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-09 12:05:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2018-12-09 12:05:30,242 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2018-12-09 12:05:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:30,242 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2018-12-09 12:05:30,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:05:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2018-12-09 12:05:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 12:05:30,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:30,243 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-12-09 12:05:30,243 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:30,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash -125424114, now seen corresponding path program 1 times [2018-12-09 12:05:30,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:30,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:30,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 12:05:30,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:30,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:05:30,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:30,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:05:30,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:05:30,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:05:30,266 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2018-12-09 12:05:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:30,310 INFO L93 Difference]: Finished difference Result 1662 states and 2463 transitions. [2018-12-09 12:05:30,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:05:30,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-09 12:05:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:30,311 INFO L225 Difference]: With dead ends: 1662 [2018-12-09 12:05:30,311 INFO L226 Difference]: Without dead ends: 961 [2018-12-09 12:05:30,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:05:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-09 12:05:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-12-09 12:05:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-09 12:05:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2018-12-09 12:05:30,336 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 111 [2018-12-09 12:05:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:30,337 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2018-12-09 12:05:30,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:05:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2018-12-09 12:05:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 12:05:30,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:30,338 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-12-09 12:05:30,338 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:30,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1174112374, now seen corresponding path program 1 times [2018-12-09 12:05:30,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 12:05:30,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:30,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:30,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:30,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:30,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:30,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:30,375 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2018-12-09 12:05:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:30,786 INFO L93 Difference]: Finished difference Result 2303 states and 3401 transitions. [2018-12-09 12:05:30,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:30,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-09 12:05:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:30,790 INFO L225 Difference]: With dead ends: 2303 [2018-12-09 12:05:30,790 INFO L226 Difference]: Without dead ends: 1369 [2018-12-09 12:05:30,791 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-12-09 12:05:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2018-12-09 12:05:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2018-12-09 12:05:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-09 12:05:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2018-12-09 12:05:30,820 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 128 [2018-12-09 12:05:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:30,820 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2018-12-09 12:05:30,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2018-12-09 12:05:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 12:05:30,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:30,821 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-12-09 12:05:30,821 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:30,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:30,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2040039334, now seen corresponding path program 1 times [2018-12-09 12:05:30,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:30,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 12:05:30,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:30,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:05:30,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:30,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:05:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:05:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:05:30,867 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2018-12-09 12:05:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:31,439 INFO L93 Difference]: Finished difference Result 2433 states and 3649 transitions. [2018-12-09 12:05:31,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:05:31,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-09 12:05:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:31,442 INFO L225 Difference]: With dead ends: 2433 [2018-12-09 12:05:31,442 INFO L226 Difference]: Without dead ends: 1343 [2018-12-09 12:05:31,443 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-12-09 12:05:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2018-12-09 12:05:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1075. [2018-12-09 12:05:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-12-09 12:05:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2018-12-09 12:05:31,473 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 129 [2018-12-09 12:05:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:31,473 INFO L480 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2018-12-09 12:05:31,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:05:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2018-12-09 12:05:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 12:05:31,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:31,474 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-12-09 12:05:31,474 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:31,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2028637021, now seen corresponding path program 1 times [2018-12-09 12:05:31,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:31,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:31,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:05:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 12:05:31,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:05:31,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:05:31,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:05:31,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:05:31,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:05:31,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:05:31,634 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 7 states. [2018-12-09 12:05:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:05:32,465 INFO L93 Difference]: Finished difference Result 3503 states and 5230 transitions. [2018-12-09 12:05:32,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:05:32,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-12-09 12:05:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:05:32,469 INFO L225 Difference]: With dead ends: 3503 [2018-12-09 12:05:32,469 INFO L226 Difference]: Without dead ends: 2453 [2018-12-09 12:05:32,471 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-12-09 12:05:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2018-12-09 12:05:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1705. [2018-12-09 12:05:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2018-12-09 12:05:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2556 transitions. [2018-12-09 12:05:32,538 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2556 transitions. Word has length 133 [2018-12-09 12:05:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:05:32,538 INFO L480 AbstractCegarLoop]: Abstraction has 1705 states and 2556 transitions. [2018-12-09 12:05:32,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:05:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2556 transitions. [2018-12-09 12:05:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 12:05:32,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:05:32,539 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-12-09 12:05:32,539 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:05:32,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:05:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1236970977, now seen corresponding path program 1 times [2018-12-09 12:05:32,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:05:32,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:32,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:05:32,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:05:32,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:05:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:05:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:05:32,640 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:05:32,673 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24588 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 12:05:32,674 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-12-09 12:05:32,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:05:32 BoogieIcfgContainer [2018-12-09 12:05:32,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:05:32,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:05:32,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:05:32,714 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:05:32,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:05:21" (3/4) ... [2018-12-09 12:05:32,717 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 12:05:32,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:05:32,717 INFO L168 Benchmark]: Toolchain (without parser) took 12464.89 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 464.5 MB). Free memory was 947.0 MB in the beginning and 947.8 MB in the end (delta: -783.9 kB). Peak memory consumption was 463.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:05:32,718 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:05:32,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:05:32,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:05:32,719 INFO L168 Benchmark]: Boogie Preprocessor took 47.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:05:32,719 INFO L168 Benchmark]: RCFGBuilder took 559.53 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: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. [2018-12-09 12:05:32,719 INFO L168 Benchmark]: TraceAbstraction took 11477.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.1 MB). Free memory was 1.0 GB in the beginning and 947.8 MB in the end (delta: 70.4 MB). Peak memory consumption was 396.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:05:32,719 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.5 GB. Free memory is still 947.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:05:32,721 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 559.53 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: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11477.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.1 MB). Free memory was 1.0 GB in the beginning and 947.8 MB in the end (delta: 70.4 MB). Peak memory consumption was 396.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.5 GB. Free memory is still 947.8 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, 11.4s OverallTime, 44 OverallIterations, 5 TraceHistogramMax, 8.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, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 88 SyntacticMatches, 77 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s 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.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 2276 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s 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-635dfa2 [2018-12-09 12:05:33,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:05:33,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:05:33,998 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:05:33,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:05:33,999 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:05:33,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:05:34,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:05:34,001 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:05:34,001 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:05:34,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:05:34,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:05:34,002 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:05:34,003 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:05:34,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:05:34,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:05:34,004 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:05:34,005 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:05:34,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:05:34,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:05:34,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:05:34,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:05:34,009 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:05:34,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:05:34,009 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:05:34,009 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:05:34,010 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:05:34,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:05:34,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:05:34,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:05:34,011 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:05:34,012 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:05:34,012 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:05:34,012 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:05:34,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:05:34,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:05:34,013 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 12:05:34,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:05:34,020 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:05:34,021 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:05:34,021 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:05:34,021 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:05:34,021 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:05:34,021 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:05:34,021 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:05:34,021 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:05:34,022 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:05:34,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:05:34,022 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:05:34,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:05:34,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:05:34,022 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:05:34,022 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:05:34,022 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:05:34,023 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 12:05:34,023 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 12:05:34,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:05:34,023 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:05:34,023 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:05:34,023 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:05:34,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:05:34,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:05:34,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:05:34,023 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:05:34,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:05:34,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:05:34,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:05:34,024 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:05:34,024 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 12:05:34,024 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:05:34,024 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 12:05:34,024 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 12:05:34,024 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_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 [2018-12-09 12:05:34,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:05:34,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:05:34,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:05:34,057 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:05:34,057 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:05:34,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-09 12:05:34,099 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data/6477913b0/336d456074c543efa7efd6f9d91406e0/FLAG2522b4a92 [2018-12-09 12:05:34,466 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:05:34,466 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-09 12:05:34,475 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data/6477913b0/336d456074c543efa7efd6f9d91406e0/FLAG2522b4a92 [2018-12-09 12:05:34,483 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a8ecffee-d8ea-4ced-8cf5-7df567963241/bin-2019/utaipan/data/6477913b0/336d456074c543efa7efd6f9d91406e0 [2018-12-09 12:05:34,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:05:34,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:05:34,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:05:34,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:05:34,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:05:34,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:05:34" (1/1) ... [2018-12-09 12:05:34,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cb6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:34, skipping insertion in model container [2018-12-09 12:05:34,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:05:34" (1/1) ... [2018-12-09 12:05:34,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:05:34,522 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:05:34,732 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:05:34,743 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:05:34,857 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:05:34,859 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 12:05:34,861 INFO L168 Benchmark]: Toolchain (without parser) took 376.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-09 12:05:34,863 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:05:34,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-09 12:05:34,865 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...