./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.16_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_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/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 0a7396ffb12cf754f13107d729c5350f83c5ce55 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/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 0a7396ffb12cf754f13107d729c5350f83c5ce55 ...................................................................................................................................................................... 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-03 04:42:09,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 04:42:09,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 04:42:09,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 04:42:09,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 04:42:09,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 04:42:09,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 04:42:09,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 04:42:09,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 04:42:09,898 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 04:42:09,898 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 04:42:09,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 04:42:09,899 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 04:42:09,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 04:42:09,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 04:42:09,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 04:42:09,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 04:42:09,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 04:42:09,902 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 04:42:09,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 04:42:09,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 04:42:09,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 04:42:09,905 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 04:42:09,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 04:42:09,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 04:42:09,906 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 04:42:09,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 04:42:09,907 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 04:42:09,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 04:42:09,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 04:42:09,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 04:42:09,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 04:42:09,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 04:42:09,909 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 04:42:09,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 04:42:09,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 04:42:09,910 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 04:42:09,917 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 04:42:09,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 04:42:09,918 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 04:42:09,918 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 04:42:09,918 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 04:42:09,918 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 04:42:09,918 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 04:42:09,918 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 04:42:09,918 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 04:42:09,918 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 04:42:09,919 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 04:42:09,919 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 04:42:09,919 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 04:42:09,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 04:42:09,919 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 04:42:09,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 04:42:09,919 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 04:42:09,919 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 04:42:09,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 04:42:09,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:42:09,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 04:42:09,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 04:42:09,921 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 04:42:09,921 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 04:42:09,921 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 04:42:09,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 04:42:09,921 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 04:42:09,921 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_d2535ddf-437e-4f4e-adca-57c112d29e64/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 -> 0a7396ffb12cf754f13107d729c5350f83c5ce55 [2018-12-03 04:42:09,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 04:42:09,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 04:42:09,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 04:42:09,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 04:42:09,952 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 04:42:09,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-03 04:42:09,998 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data/7c4205342/54616dc8d66c4c2a81871f93d7932827/FLAG2147aea5a [2018-12-03 04:42:10,474 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 04:42:10,474 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-03 04:42:10,488 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data/7c4205342/54616dc8d66c4c2a81871f93d7932827/FLAG2147aea5a [2018-12-03 04:42:10,971 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data/7c4205342/54616dc8d66c4c2a81871f93d7932827 [2018-12-03 04:42:10,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 04:42:10,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 04:42:10,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 04:42:10,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 04:42:10,977 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 04:42:10,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:42:10" (1/1) ... [2018-12-03 04:42:10,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543f4e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:10, skipping insertion in model container [2018-12-03 04:42:10,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:42:10" (1/1) ... [2018-12-03 04:42:10,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 04:42:11,013 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 04:42:11,288 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:42:11,296 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 04:42:11,353 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:42:11,364 INFO L195 MainTranslator]: Completed translation [2018-12-03 04:42:11,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11 WrapperNode [2018-12-03 04:42:11,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 04:42:11,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 04:42:11,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 04:42:11,365 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 04:42:11,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... [2018-12-03 04:42:11,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... [2018-12-03 04:42:11,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 04:42:11,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 04:42:11,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 04:42:11,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 04:42:11,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... [2018-12-03 04:42:11,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... [2018-12-03 04:42:11,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... [2018-12-03 04:42:11,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... [2018-12-03 04:42:11,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... [2018-12-03 04:42:11,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... [2018-12-03 04:42:11,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... [2018-12-03 04:42:11,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 04:42:11,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 04:42:11,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 04:42:11,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 04:42:11,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/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-03 04:42:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 04:42:11,471 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-03 04:42:11,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 04:42:11,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 04:42:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 04:42:11,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 04:42:11,664 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 04:42:11,664 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 04:42:12,014 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 04:42:12,015 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 04:42:12,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:12 BoogieIcfgContainer [2018-12-03 04:42:12,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 04:42:12,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 04:42:12,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 04:42:12,018 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 04:42:12,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 04:42:10" (1/3) ... [2018-12-03 04:42:12,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652f12ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:12, skipping insertion in model container [2018-12-03 04:42:12,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:11" (2/3) ... [2018-12-03 04:42:12,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652f12ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:12, skipping insertion in model container [2018-12-03 04:42:12,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:12" (3/3) ... [2018-12-03 04:42:12,021 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-03 04:42:12,029 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 04:42:12,035 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 04:42:12,048 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 04:42:12,070 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 04:42:12,070 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 04:42:12,070 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 04:42:12,070 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 04:42:12,070 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 04:42:12,070 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 04:42:12,071 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 04:42:12,071 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 04:42:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-12-03 04:42:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 04:42:12,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:12,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:12,090 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:12,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2113124833, now seen corresponding path program 1 times [2018-12-03 04:42:12,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:12,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:12,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:12,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:12,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:12,281 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-03 04:42:12,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:12,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:12,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:12,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:12,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:12,296 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 4 states. [2018-12-03 04:42:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:12,528 INFO L93 Difference]: Finished difference Result 349 states and 590 transitions. [2018-12-03 04:42:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:12,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-03 04:42:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:12,537 INFO L225 Difference]: With dead ends: 349 [2018-12-03 04:42:12,537 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 04:42:12,539 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-03 04:42:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 04:42:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2018-12-03 04:42:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 04:42:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2018-12-03 04:42:12,568 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 49 [2018-12-03 04:42:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:12,569 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2018-12-03 04:42:12,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2018-12-03 04:42:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 04:42:12,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:12,571 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:12,571 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:12,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1676763913, now seen corresponding path program 1 times [2018-12-03 04:42:12,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:12,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:12,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:12,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:12,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:12,660 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-03 04:42:12,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:12,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:12,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:12,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:12,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:12,663 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand 4 states. [2018-12-03 04:42:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:12,852 INFO L93 Difference]: Finished difference Result 312 states and 481 transitions. [2018-12-03 04:42:12,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:12,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-03 04:42:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:12,853 INFO L225 Difference]: With dead ends: 312 [2018-12-03 04:42:12,854 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 04:42:12,855 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-03 04:42:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 04:42:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2018-12-03 04:42:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 04:42:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 247 transitions. [2018-12-03 04:42:12,865 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 247 transitions. Word has length 62 [2018-12-03 04:42:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:12,865 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 247 transitions. [2018-12-03 04:42:12,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 247 transitions. [2018-12-03 04:42:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 04:42:12,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:12,867 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:12,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:12,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash -779258403, now seen corresponding path program 1 times [2018-12-03 04:42:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:12,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:12,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:12,940 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-03 04:42:12,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:12,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:42:12,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:12,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:42:12,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:42:12,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:42:12,942 INFO L87 Difference]: Start difference. First operand 160 states and 247 transitions. Second operand 5 states. [2018-12-03 04:42:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:13,244 INFO L93 Difference]: Finished difference Result 316 states and 489 transitions. [2018-12-03 04:42:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:42:13,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-03 04:42:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:13,245 INFO L225 Difference]: With dead ends: 316 [2018-12-03 04:42:13,245 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 04:42:13,246 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-03 04:42:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 04:42:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-12-03 04:42:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 04:42:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2018-12-03 04:42:13,251 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 63 [2018-12-03 04:42:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:13,251 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2018-12-03 04:42:13,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:42:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2018-12-03 04:42:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 04:42:13,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:13,253 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:13,253 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:13,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:13,253 INFO L82 PathProgramCache]: Analyzing trace with hash 335748436, now seen corresponding path program 1 times [2018-12-03 04:42:13,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:13,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:13,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:13,294 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-03 04:42:13,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:13,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:13,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:13,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:13,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:13,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:13,295 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand 4 states. [2018-12-03 04:42:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:13,460 INFO L93 Difference]: Finished difference Result 349 states and 529 transitions. [2018-12-03 04:42:13,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:13,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-03 04:42:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:13,461 INFO L225 Difference]: With dead ends: 349 [2018-12-03 04:42:13,461 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 04:42:13,462 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-03 04:42:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 04:42:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 180. [2018-12-03 04:42:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 04:42:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2018-12-03 04:42:13,467 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 63 [2018-12-03 04:42:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:13,467 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2018-12-03 04:42:13,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2018-12-03 04:42:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 04:42:13,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:13,468 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:13,468 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:13,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash 403308437, now seen corresponding path program 1 times [2018-12-03 04:42:13,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:13,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:13,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:13,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:13,519 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-03 04:42:13,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:13,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:13,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:13,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:13,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:13,520 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand 4 states. [2018-12-03 04:42:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:13,671 INFO L93 Difference]: Finished difference Result 348 states and 527 transitions. [2018-12-03 04:42:13,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:13,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-03 04:42:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:13,672 INFO L225 Difference]: With dead ends: 348 [2018-12-03 04:42:13,672 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 04:42:13,673 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-03 04:42:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 04:42:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2018-12-03 04:42:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 04:42:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 271 transitions. [2018-12-03 04:42:13,679 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 271 transitions. Word has length 63 [2018-12-03 04:42:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:13,679 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 271 transitions. [2018-12-03 04:42:13,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 271 transitions. [2018-12-03 04:42:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 04:42:13,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:13,680 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:13,681 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:13,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:13,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1696423930, now seen corresponding path program 1 times [2018-12-03 04:42:13,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:13,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:13,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:13,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:13,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:13,735 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-03 04:42:13,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:13,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:13,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:13,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:13,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:13,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:13,736 INFO L87 Difference]: Start difference. First operand 180 states and 271 transitions. Second operand 4 states. [2018-12-03 04:42:13,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:13,872 INFO L93 Difference]: Finished difference Result 348 states and 526 transitions. [2018-12-03 04:42:13,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:13,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-03 04:42:13,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:13,873 INFO L225 Difference]: With dead ends: 348 [2018-12-03 04:42:13,873 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 04:42:13,874 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-03 04:42:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 04:42:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2018-12-03 04:42:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 04:42:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 270 transitions. [2018-12-03 04:42:13,878 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 270 transitions. Word has length 64 [2018-12-03 04:42:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:13,878 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 270 transitions. [2018-12-03 04:42:13,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 270 transitions. [2018-12-03 04:42:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 04:42:13,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:13,879 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:13,879 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:13,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash -822831919, now seen corresponding path program 1 times [2018-12-03 04:42:13,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:13,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:13,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:13,921 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-03 04:42:13,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:13,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:13,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:13,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:13,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:13,922 INFO L87 Difference]: Start difference. First operand 180 states and 270 transitions. Second operand 4 states. [2018-12-03 04:42:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:14,072 INFO L93 Difference]: Finished difference Result 348 states and 525 transitions. [2018-12-03 04:42:14,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:14,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-03 04:42:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:14,074 INFO L225 Difference]: With dead ends: 348 [2018-12-03 04:42:14,074 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 04:42:14,074 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-03 04:42:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 04:42:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2018-12-03 04:42:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 04:42:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 269 transitions. [2018-12-03 04:42:14,081 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 269 transitions. Word has length 65 [2018-12-03 04:42:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:14,081 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 269 transitions. [2018-12-03 04:42:14,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 269 transitions. [2018-12-03 04:42:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:42:14,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:14,082 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:14,082 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:14,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:14,083 INFO L82 PathProgramCache]: Analyzing trace with hash 823556384, now seen corresponding path program 1 times [2018-12-03 04:42:14,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:14,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:14,124 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-03 04:42:14,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:14,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:14,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:14,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:14,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:14,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:14,125 INFO L87 Difference]: Start difference. First operand 180 states and 269 transitions. Second operand 4 states. [2018-12-03 04:42:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:14,296 INFO L93 Difference]: Finished difference Result 377 states and 571 transitions. [2018-12-03 04:42:14,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:14,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-03 04:42:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:14,298 INFO L225 Difference]: With dead ends: 377 [2018-12-03 04:42:14,298 INFO L226 Difference]: Without dead ends: 222 [2018-12-03 04:42:14,298 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-03 04:42:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-03 04:42:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2018-12-03 04:42:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 306 transitions. [2018-12-03 04:42:14,302 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 306 transitions. Word has length 66 [2018-12-03 04:42:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:14,302 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 306 transitions. [2018-12-03 04:42:14,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 306 transitions. [2018-12-03 04:42:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:42:14,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:14,303 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:14,303 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:14,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:14,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1041654465, now seen corresponding path program 1 times [2018-12-03 04:42:14,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:14,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:14,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:14,339 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-03 04:42:14,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:14,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:14,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:14,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:14,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:14,340 INFO L87 Difference]: Start difference. First operand 202 states and 306 transitions. Second operand 4 states. [2018-12-03 04:42:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:14,470 INFO L93 Difference]: Finished difference Result 392 states and 598 transitions. [2018-12-03 04:42:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:14,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-03 04:42:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:14,471 INFO L225 Difference]: With dead ends: 392 [2018-12-03 04:42:14,471 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 04:42:14,472 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-03 04:42:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 04:42:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2018-12-03 04:42:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 305 transitions. [2018-12-03 04:42:14,475 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 305 transitions. Word has length 66 [2018-12-03 04:42:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:14,476 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 305 transitions. [2018-12-03 04:42:14,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 305 transitions. [2018-12-03 04:42:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 04:42:14,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:14,476 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:14,477 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:14,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:14,477 INFO L82 PathProgramCache]: Analyzing trace with hash -735871956, now seen corresponding path program 1 times [2018-12-03 04:42:14,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:14,510 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-03 04:42:14,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:14,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:14,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:14,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:14,511 INFO L87 Difference]: Start difference. First operand 202 states and 305 transitions. Second operand 4 states. [2018-12-03 04:42:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:14,648 INFO L93 Difference]: Finished difference Result 382 states and 585 transitions. [2018-12-03 04:42:14,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:14,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 04:42:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:14,649 INFO L225 Difference]: With dead ends: 382 [2018-12-03 04:42:14,649 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 04:42:14,649 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-03 04:42:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 04:42:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-12-03 04:42:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2018-12-03 04:42:14,656 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 304 transitions. Word has length 67 [2018-12-03 04:42:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:14,657 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 304 transitions. [2018-12-03 04:42:14,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 304 transitions. [2018-12-03 04:42:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 04:42:14,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:14,658 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:14,658 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:14,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:14,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1729208874, now seen corresponding path program 1 times [2018-12-03 04:42:14,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:14,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:14,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:14,733 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-03 04:42:14,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:14,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:14,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:14,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:14,734 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand 4 states. [2018-12-03 04:42:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:14,927 INFO L93 Difference]: Finished difference Result 399 states and 605 transitions. [2018-12-03 04:42:14,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:14,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-03 04:42:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:14,928 INFO L225 Difference]: With dead ends: 399 [2018-12-03 04:42:14,928 INFO L226 Difference]: Without dead ends: 222 [2018-12-03 04:42:14,929 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-03 04:42:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-03 04:42:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2018-12-03 04:42:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 303 transitions. [2018-12-03 04:42:14,932 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 303 transitions. Word has length 79 [2018-12-03 04:42:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:14,933 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 303 transitions. [2018-12-03 04:42:14,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 303 transitions. [2018-12-03 04:42:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 04:42:14,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:14,933 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:14,933 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:14,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:14,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1961542227, now seen corresponding path program 1 times [2018-12-03 04:42:14,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:14,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:14,963 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-03 04:42:14,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:14,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:14,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:14,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:14,964 INFO L87 Difference]: Start difference. First operand 202 states and 303 transitions. Second operand 4 states. [2018-12-03 04:42:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:15,133 INFO L93 Difference]: Finished difference Result 397 states and 601 transitions. [2018-12-03 04:42:15,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:15,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-03 04:42:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:15,134 INFO L225 Difference]: With dead ends: 397 [2018-12-03 04:42:15,134 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 04:42:15,134 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-03 04:42:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 04:42:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 202. [2018-12-03 04:42:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2018-12-03 04:42:15,138 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 80 [2018-12-03 04:42:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:15,139 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2018-12-03 04:42:15,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2018-12-03 04:42:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 04:42:15,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:15,139 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:15,139 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:15,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:15,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2029102228, now seen corresponding path program 1 times [2018-12-03 04:42:15,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:15,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:15,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:15,173 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-03 04:42:15,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:15,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:15,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:15,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:15,174 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand 4 states. [2018-12-03 04:42:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:15,324 INFO L93 Difference]: Finished difference Result 396 states and 598 transitions. [2018-12-03 04:42:15,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:15,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-03 04:42:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:15,325 INFO L225 Difference]: With dead ends: 396 [2018-12-03 04:42:15,325 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 04:42:15,326 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-03 04:42:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 04:42:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2018-12-03 04:42:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2018-12-03 04:42:15,332 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 80 [2018-12-03 04:42:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:15,332 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 301 transitions. [2018-12-03 04:42:15,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions. [2018-12-03 04:42:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 04:42:15,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:15,333 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:15,333 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:15,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1458543335, now seen corresponding path program 1 times [2018-12-03 04:42:15,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:15,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:15,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:15,385 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-03 04:42:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:15,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:15,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:15,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:15,385 INFO L87 Difference]: Start difference. First operand 202 states and 301 transitions. Second operand 4 states. [2018-12-03 04:42:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:15,548 INFO L93 Difference]: Finished difference Result 396 states and 596 transitions. [2018-12-03 04:42:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:15,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 04:42:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:15,549 INFO L225 Difference]: With dead ends: 396 [2018-12-03 04:42:15,549 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 04:42:15,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 04:42:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2018-12-03 04:42:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 300 transitions. [2018-12-03 04:42:15,554 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 300 transitions. Word has length 81 [2018-12-03 04:42:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:15,554 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 300 transitions. [2018-12-03 04:42:15,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 300 transitions. [2018-12-03 04:42:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 04:42:15,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:15,555 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:15,555 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:15,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1803094512, now seen corresponding path program 1 times [2018-12-03 04:42:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:15,594 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-03 04:42:15,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:15,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:15,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:15,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:15,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:15,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:15,595 INFO L87 Difference]: Start difference. First operand 202 states and 300 transitions. Second operand 4 states. [2018-12-03 04:42:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:15,730 INFO L93 Difference]: Finished difference Result 396 states and 594 transitions. [2018-12-03 04:42:15,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:15,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-03 04:42:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:15,731 INFO L225 Difference]: With dead ends: 396 [2018-12-03 04:42:15,731 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 04:42:15,732 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-03 04:42:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 04:42:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2018-12-03 04:42:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2018-12-03 04:42:15,737 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 82 [2018-12-03 04:42:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:15,738 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2018-12-03 04:42:15,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2018-12-03 04:42:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 04:42:15,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:15,738 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:15,738 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:15,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:15,739 INFO L82 PathProgramCache]: Analyzing trace with hash 718285154, now seen corresponding path program 1 times [2018-12-03 04:42:15,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:15,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:15,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:15,781 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-03 04:42:15,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:15,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:15,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:15,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:15,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:15,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:15,782 INFO L87 Difference]: Start difference. First operand 202 states and 299 transitions. Second operand 4 states. [2018-12-03 04:42:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:15,923 INFO L93 Difference]: Finished difference Result 396 states and 592 transitions. [2018-12-03 04:42:15,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:15,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-03 04:42:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:15,924 INFO L225 Difference]: With dead ends: 396 [2018-12-03 04:42:15,924 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 04:42:15,924 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-03 04:42:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 04:42:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2018-12-03 04:42:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 298 transitions. [2018-12-03 04:42:15,928 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 298 transitions. Word has length 83 [2018-12-03 04:42:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:15,928 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 298 transitions. [2018-12-03 04:42:15,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 298 transitions. [2018-12-03 04:42:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 04:42:15,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:15,929 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:15,929 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:15,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:15,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2124581291, now seen corresponding path program 1 times [2018-12-03 04:42:15,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:15,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:15,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:15,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:15,973 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-03 04:42:15,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:15,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:15,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:15,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:15,973 INFO L87 Difference]: Start difference. First operand 202 states and 298 transitions. Second operand 4 states. [2018-12-03 04:42:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:16,113 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2018-12-03 04:42:16,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:16,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-03 04:42:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:16,114 INFO L225 Difference]: With dead ends: 386 [2018-12-03 04:42:16,114 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 04:42:16,114 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-03 04:42:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 04:42:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2018-12-03 04:42:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 04:42:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 297 transitions. [2018-12-03 04:42:16,119 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 297 transitions. Word has length 84 [2018-12-03 04:42:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:16,120 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 297 transitions. [2018-12-03 04:42:16,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 297 transitions. [2018-12-03 04:42:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 04:42:16,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:16,121 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-03 04:42:16,121 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:16,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:16,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2086927363, now seen corresponding path program 1 times [2018-12-03 04:42:16,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:16,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:16,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:16,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:16,187 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-03 04:42:16,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:16,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:16,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:16,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:16,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:16,188 INFO L87 Difference]: Start difference. First operand 202 states and 297 transitions. Second operand 4 states. [2018-12-03 04:42:16,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:16,429 INFO L93 Difference]: Finished difference Result 491 states and 740 transitions. [2018-12-03 04:42:16,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:16,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-03 04:42:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:16,430 INFO L225 Difference]: With dead ends: 491 [2018-12-03 04:42:16,430 INFO L226 Difference]: Without dead ends: 314 [2018-12-03 04:42:16,430 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-03 04:42:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-03 04:42:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 243. [2018-12-03 04:42:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 04:42:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 370 transitions. [2018-12-03 04:42:16,435 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 370 transitions. Word has length 88 [2018-12-03 04:42:16,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:16,435 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 370 transitions. [2018-12-03 04:42:16,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 370 transitions. [2018-12-03 04:42:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 04:42:16,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:16,436 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-03 04:42:16,436 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:16,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:16,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1784393211, now seen corresponding path program 1 times [2018-12-03 04:42:16,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:16,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:16,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:16,485 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-03 04:42:16,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:16,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:16,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:16,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:16,486 INFO L87 Difference]: Start difference. First operand 243 states and 370 transitions. Second operand 4 states. [2018-12-03 04:42:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:16,675 INFO L93 Difference]: Finished difference Result 510 states and 786 transitions. [2018-12-03 04:42:16,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:16,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-03 04:42:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:16,676 INFO L225 Difference]: With dead ends: 510 [2018-12-03 04:42:16,676 INFO L226 Difference]: Without dead ends: 292 [2018-12-03 04:42:16,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:42:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-03 04:42:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 267. [2018-12-03 04:42:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-03 04:42:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2018-12-03 04:42:16,682 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 88 [2018-12-03 04:42:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:16,682 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2018-12-03 04:42:16,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2018-12-03 04:42:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 04:42:16,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:16,683 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:16,683 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:16,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:16,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1411818959, now seen corresponding path program 1 times [2018-12-03 04:42:16,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:16,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:16,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:16,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:16,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:16,721 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-03 04:42:16,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:16,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:16,721 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:16,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:16,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:16,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:16,722 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand 4 states. [2018-12-03 04:42:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:16,927 INFO L93 Difference]: Finished difference Result 572 states and 883 transitions. [2018-12-03 04:42:16,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:16,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-03 04:42:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:16,928 INFO L225 Difference]: With dead ends: 572 [2018-12-03 04:42:16,928 INFO L226 Difference]: Without dead ends: 330 [2018-12-03 04:42:16,929 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-03 04:42:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-03 04:42:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2018-12-03 04:42:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 412 transitions. [2018-12-03 04:42:16,934 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 412 transitions. Word has length 89 [2018-12-03 04:42:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:16,934 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 412 transitions. [2018-12-03 04:42:16,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 412 transitions. [2018-12-03 04:42:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 04:42:16,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:16,935 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:16,935 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:16,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1997461465, now seen corresponding path program 1 times [2018-12-03 04:42:16,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:16,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:16,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:16,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:16,967 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-03 04:42:16,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:16,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:16,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:16,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:16,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:16,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:16,968 INFO L87 Difference]: Start difference. First operand 268 states and 412 transitions. Second operand 4 states. [2018-12-03 04:42:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:17,176 INFO L93 Difference]: Finished difference Result 573 states and 883 transitions. [2018-12-03 04:42:17,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:17,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-03 04:42:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:17,177 INFO L225 Difference]: With dead ends: 573 [2018-12-03 04:42:17,177 INFO L226 Difference]: Without dead ends: 330 [2018-12-03 04:42:17,177 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-03 04:42:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-03 04:42:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2018-12-03 04:42:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 411 transitions. [2018-12-03 04:42:17,182 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 411 transitions. Word has length 101 [2018-12-03 04:42:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:17,182 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 411 transitions. [2018-12-03 04:42:17,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 411 transitions. [2018-12-03 04:42:17,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 04:42:17,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:17,183 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:17,183 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:17,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:17,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1121442459, now seen corresponding path program 1 times [2018-12-03 04:42:17,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:17,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:17,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:17,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:17,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:17,215 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-03 04:42:17,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:17,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:17,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:17,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:17,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:17,216 INFO L87 Difference]: Start difference. First operand 268 states and 411 transitions. Second operand 4 states. [2018-12-03 04:42:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:17,374 INFO L93 Difference]: Finished difference Result 536 states and 826 transitions. [2018-12-03 04:42:17,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:17,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-03 04:42:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:17,375 INFO L225 Difference]: With dead ends: 536 [2018-12-03 04:42:17,375 INFO L226 Difference]: Without dead ends: 293 [2018-12-03 04:42:17,376 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-03 04:42:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-03 04:42:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2018-12-03 04:42:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 410 transitions. [2018-12-03 04:42:17,381 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 410 transitions. Word has length 101 [2018-12-03 04:42:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:17,381 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 410 transitions. [2018-12-03 04:42:17,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 410 transitions. [2018-12-03 04:42:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 04:42:17,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:17,382 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:17,382 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:17,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1896088586, now seen corresponding path program 1 times [2018-12-03 04:42:17,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:17,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:17,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:17,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:17,413 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-03 04:42:17,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:17,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:17,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:17,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:17,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:17,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:17,414 INFO L87 Difference]: Start difference. First operand 268 states and 410 transitions. Second operand 4 states. [2018-12-03 04:42:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:17,617 INFO L93 Difference]: Finished difference Result 571 states and 877 transitions. [2018-12-03 04:42:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:17,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-03 04:42:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:17,618 INFO L225 Difference]: With dead ends: 571 [2018-12-03 04:42:17,618 INFO L226 Difference]: Without dead ends: 328 [2018-12-03 04:42:17,619 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-03 04:42:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-03 04:42:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 268. [2018-12-03 04:42:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 409 transitions. [2018-12-03 04:42:17,628 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 409 transitions. Word has length 102 [2018-12-03 04:42:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:17,628 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 409 transitions. [2018-12-03 04:42:17,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 409 transitions. [2018-12-03 04:42:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 04:42:17,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:17,629 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:17,629 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:17,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1828528585, now seen corresponding path program 1 times [2018-12-03 04:42:17,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:17,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:17,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:17,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:17,670 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-03 04:42:17,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:17,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:17,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:17,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:17,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:17,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:17,671 INFO L87 Difference]: Start difference. First operand 268 states and 409 transitions. Second operand 4 states. [2018-12-03 04:42:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:17,887 INFO L93 Difference]: Finished difference Result 570 states and 874 transitions. [2018-12-03 04:42:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:17,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-03 04:42:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:17,888 INFO L225 Difference]: With dead ends: 570 [2018-12-03 04:42:17,888 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 04:42:17,888 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-03 04:42:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 04:42:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2018-12-03 04:42:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 408 transitions. [2018-12-03 04:42:17,893 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 408 transitions. Word has length 102 [2018-12-03 04:42:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:17,894 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 408 transitions. [2018-12-03 04:42:17,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 408 transitions. [2018-12-03 04:42:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 04:42:17,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:17,894 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:17,894 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:17,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:17,894 INFO L82 PathProgramCache]: Analyzing trace with hash -509303176, now seen corresponding path program 1 times [2018-12-03 04:42:17,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:17,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:17,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:17,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:17,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:17,928 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-03 04:42:17,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:17,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:17,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:17,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:17,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:17,929 INFO L87 Difference]: Start difference. First operand 268 states and 408 transitions. Second operand 4 states. [2018-12-03 04:42:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:18,113 INFO L93 Difference]: Finished difference Result 534 states and 818 transitions. [2018-12-03 04:42:18,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:18,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-03 04:42:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:18,114 INFO L225 Difference]: With dead ends: 534 [2018-12-03 04:42:18,114 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 04:42:18,115 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-03 04:42:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 04:42:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 268. [2018-12-03 04:42:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 407 transitions. [2018-12-03 04:42:18,124 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 407 transitions. Word has length 102 [2018-12-03 04:42:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:18,124 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 407 transitions. [2018-12-03 04:42:18,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 407 transitions. [2018-12-03 04:42:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 04:42:18,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:18,125 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:18,125 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:18,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:18,126 INFO L82 PathProgramCache]: Analyzing trace with hash -441743175, now seen corresponding path program 1 times [2018-12-03 04:42:18,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:18,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:18,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:18,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:18,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:18,167 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-03 04:42:18,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:18,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:18,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:18,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:18,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:18,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:18,168 INFO L87 Difference]: Start difference. First operand 268 states and 407 transitions. Second operand 4 states. [2018-12-03 04:42:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:18,341 INFO L93 Difference]: Finished difference Result 533 states and 815 transitions. [2018-12-03 04:42:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:18,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-03 04:42:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:18,343 INFO L225 Difference]: With dead ends: 533 [2018-12-03 04:42:18,343 INFO L226 Difference]: Without dead ends: 290 [2018-12-03 04:42:18,344 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-03 04:42:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-03 04:42:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2018-12-03 04:42:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 406 transitions. [2018-12-03 04:42:18,353 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 406 transitions. Word has length 102 [2018-12-03 04:42:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:18,354 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 406 transitions. [2018-12-03 04:42:18,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 406 transitions. [2018-12-03 04:42:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 04:42:18,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:18,355 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:18,355 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:18,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2131072420, now seen corresponding path program 1 times [2018-12-03 04:42:18,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:18,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:18,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:18,390 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-03 04:42:18,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:18,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:18,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:18,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:18,391 INFO L87 Difference]: Start difference. First operand 268 states and 406 transitions. Second operand 4 states. [2018-12-03 04:42:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:18,585 INFO L93 Difference]: Finished difference Result 570 states and 868 transitions. [2018-12-03 04:42:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:18,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-03 04:42:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:18,586 INFO L225 Difference]: With dead ends: 570 [2018-12-03 04:42:18,586 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 04:42:18,587 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-03 04:42:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 04:42:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2018-12-03 04:42:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 405 transitions. [2018-12-03 04:42:18,597 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 405 transitions. Word has length 103 [2018-12-03 04:42:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:18,597 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 405 transitions. [2018-12-03 04:42:18,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 405 transitions. [2018-12-03 04:42:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 04:42:18,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:18,598 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:18,598 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:18,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2123220126, now seen corresponding path program 1 times [2018-12-03 04:42:18,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:18,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:18,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:18,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:18,632 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-03 04:42:18,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:18,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:18,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:18,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:18,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:18,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:18,633 INFO L87 Difference]: Start difference. First operand 268 states and 405 transitions. Second operand 4 states. [2018-12-03 04:42:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:18,791 INFO L93 Difference]: Finished difference Result 533 states and 811 transitions. [2018-12-03 04:42:18,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:18,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-03 04:42:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:18,792 INFO L225 Difference]: With dead ends: 533 [2018-12-03 04:42:18,792 INFO L226 Difference]: Without dead ends: 290 [2018-12-03 04:42:18,792 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-03 04:42:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-03 04:42:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2018-12-03 04:42:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 404 transitions. [2018-12-03 04:42:18,798 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 404 transitions. Word has length 103 [2018-12-03 04:42:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:18,798 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 404 transitions. [2018-12-03 04:42:18,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 404 transitions. [2018-12-03 04:42:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:42:18,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:18,799 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:18,799 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:18,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:18,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1865437939, now seen corresponding path program 1 times [2018-12-03 04:42:18,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:18,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:18,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:18,831 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-03 04:42:18,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:18,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:18,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:18,832 INFO L87 Difference]: Start difference. First operand 268 states and 404 transitions. Second operand 4 states. [2018-12-03 04:42:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:19,043 INFO L93 Difference]: Finished difference Result 570 states and 864 transitions. [2018-12-03 04:42:19,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:19,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-03 04:42:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:19,044 INFO L225 Difference]: With dead ends: 570 [2018-12-03 04:42:19,044 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 04:42:19,045 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-03 04:42:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 04:42:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2018-12-03 04:42:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 403 transitions. [2018-12-03 04:42:19,051 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 403 transitions. Word has length 104 [2018-12-03 04:42:19,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:19,051 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 403 transitions. [2018-12-03 04:42:19,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 403 transitions. [2018-12-03 04:42:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:42:19,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:19,052 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:19,052 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:19,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:19,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1168612107, now seen corresponding path program 1 times [2018-12-03 04:42:19,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:19,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:19,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:19,081 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-03 04:42:19,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:19,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:19,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:19,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:19,082 INFO L87 Difference]: Start difference. First operand 268 states and 403 transitions. Second operand 4 states. [2018-12-03 04:42:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:19,239 INFO L93 Difference]: Finished difference Result 533 states and 807 transitions. [2018-12-03 04:42:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:19,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-03 04:42:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:19,240 INFO L225 Difference]: With dead ends: 533 [2018-12-03 04:42:19,240 INFO L226 Difference]: Without dead ends: 290 [2018-12-03 04:42:19,240 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-03 04:42:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-03 04:42:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2018-12-03 04:42:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 402 transitions. [2018-12-03 04:42:19,246 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 402 transitions. Word has length 104 [2018-12-03 04:42:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:19,246 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 402 transitions. [2018-12-03 04:42:19,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 402 transitions. [2018-12-03 04:42:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 04:42:19,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:19,247 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:19,247 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:19,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1521325857, now seen corresponding path program 1 times [2018-12-03 04:42:19,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:19,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:19,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:19,279 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-03 04:42:19,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:19,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:19,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:19,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:19,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:19,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:19,280 INFO L87 Difference]: Start difference. First operand 268 states and 402 transitions. Second operand 4 states. [2018-12-03 04:42:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:19,503 INFO L93 Difference]: Finished difference Result 570 states and 860 transitions. [2018-12-03 04:42:19,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:19,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-03 04:42:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:19,504 INFO L225 Difference]: With dead ends: 570 [2018-12-03 04:42:19,504 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 04:42:19,505 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-03 04:42:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 04:42:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2018-12-03 04:42:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 401 transitions. [2018-12-03 04:42:19,515 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 401 transitions. Word has length 105 [2018-12-03 04:42:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:19,515 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 401 transitions. [2018-12-03 04:42:19,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2018-12-03 04:42:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 04:42:19,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:19,516 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:19,516 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:19,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1087596771, now seen corresponding path program 1 times [2018-12-03 04:42:19,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:19,565 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-03 04:42:19,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:19,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:19,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:19,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:19,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:19,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:19,566 INFO L87 Difference]: Start difference. First operand 268 states and 401 transitions. Second operand 4 states. [2018-12-03 04:42:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:19,718 INFO L93 Difference]: Finished difference Result 533 states and 803 transitions. [2018-12-03 04:42:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:19,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-03 04:42:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:19,718 INFO L225 Difference]: With dead ends: 533 [2018-12-03 04:42:19,718 INFO L226 Difference]: Without dead ends: 290 [2018-12-03 04:42:19,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:42:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-03 04:42:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2018-12-03 04:42:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 400 transitions. [2018-12-03 04:42:19,726 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 400 transitions. Word has length 105 [2018-12-03 04:42:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:19,726 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 400 transitions. [2018-12-03 04:42:19,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 400 transitions. [2018-12-03 04:42:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 04:42:19,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:19,727 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:19,727 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:19,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:19,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1416116686, now seen corresponding path program 1 times [2018-12-03 04:42:19,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:19,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:19,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:19,767 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-03 04:42:19,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:19,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:19,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:19,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:19,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:19,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:19,768 INFO L87 Difference]: Start difference. First operand 268 states and 400 transitions. Second operand 4 states. [2018-12-03 04:42:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:19,962 INFO L93 Difference]: Finished difference Result 560 states and 844 transitions. [2018-12-03 04:42:19,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:19,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-03 04:42:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:19,963 INFO L225 Difference]: With dead ends: 560 [2018-12-03 04:42:19,963 INFO L226 Difference]: Without dead ends: 317 [2018-12-03 04:42:19,964 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-03 04:42:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-12-03 04:42:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2018-12-03 04:42:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 399 transitions. [2018-12-03 04:42:19,971 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 399 transitions. Word has length 106 [2018-12-03 04:42:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:19,971 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 399 transitions. [2018-12-03 04:42:19,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 399 transitions. [2018-12-03 04:42:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 04:42:19,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:19,972 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:19,972 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:19,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1976816464, now seen corresponding path program 1 times [2018-12-03 04:42:19,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:19,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:20,008 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-03 04:42:20,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:20,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:20,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:20,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:20,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:20,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:20,009 INFO L87 Difference]: Start difference. First operand 268 states and 399 transitions. Second operand 4 states. [2018-12-03 04:42:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:20,163 INFO L93 Difference]: Finished difference Result 523 states and 787 transitions. [2018-12-03 04:42:20,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:20,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-03 04:42:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:20,164 INFO L225 Difference]: With dead ends: 523 [2018-12-03 04:42:20,164 INFO L226 Difference]: Without dead ends: 280 [2018-12-03 04:42:20,164 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-03 04:42:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-03 04:42:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 268. [2018-12-03 04:42:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 398 transitions. [2018-12-03 04:42:20,171 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 398 transitions. Word has length 106 [2018-12-03 04:42:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:20,172 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 398 transitions. [2018-12-03 04:42:20,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 398 transitions. [2018-12-03 04:42:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 04:42:20,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:20,173 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] [2018-12-03 04:42:20,173 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:20,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:20,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1089467252, now seen corresponding path program 1 times [2018-12-03 04:42:20,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:20,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:20,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:20,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:20,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:20,207 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-03 04:42:20,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:20,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:20,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:20,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:20,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:20,207 INFO L87 Difference]: Start difference. First operand 268 states and 398 transitions. Second operand 4 states. [2018-12-03 04:42:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:20,589 INFO L93 Difference]: Finished difference Result 560 states and 840 transitions. [2018-12-03 04:42:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:20,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-03 04:42:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:20,592 INFO L225 Difference]: With dead ends: 560 [2018-12-03 04:42:20,592 INFO L226 Difference]: Without dead ends: 317 [2018-12-03 04:42:20,593 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-03 04:42:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-12-03 04:42:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2018-12-03 04:42:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 04:42:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 397 transitions. [2018-12-03 04:42:20,603 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 397 transitions. Word has length 110 [2018-12-03 04:42:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:20,603 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 397 transitions. [2018-12-03 04:42:20,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 397 transitions. [2018-12-03 04:42:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 04:42:20,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:20,604 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] [2018-12-03 04:42:20,604 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:20,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:20,605 INFO L82 PathProgramCache]: Analyzing trace with hash 672070646, now seen corresponding path program 1 times [2018-12-03 04:42:20,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:20,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:20,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:20,646 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-03 04:42:20,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:20,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:20,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:20,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:20,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:20,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:20,646 INFO L87 Difference]: Start difference. First operand 268 states and 397 transitions. Second operand 4 states. [2018-12-03 04:42:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:20,811 INFO L93 Difference]: Finished difference Result 564 states and 847 transitions. [2018-12-03 04:42:20,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:20,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-03 04:42:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:20,811 INFO L225 Difference]: With dead ends: 564 [2018-12-03 04:42:20,812 INFO L226 Difference]: Without dead ends: 321 [2018-12-03 04:42:20,812 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-03 04:42:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-03 04:42:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 294. [2018-12-03 04:42:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 442 transitions. [2018-12-03 04:42:20,818 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 442 transitions. Word has length 110 [2018-12-03 04:42:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:20,819 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 442 transitions. [2018-12-03 04:42:20,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 442 transitions. [2018-12-03 04:42:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 04:42:20,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:20,819 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:20,819 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:20,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash -40281660, now seen corresponding path program 1 times [2018-12-03 04:42:20,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:20,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:20,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:20,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:20,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:20,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:20,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:20,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:20,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:20,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:20,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:20,856 INFO L87 Difference]: Start difference. First operand 294 states and 442 transitions. Second operand 4 states. [2018-12-03 04:42:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:21,045 INFO L93 Difference]: Finished difference Result 612 states and 928 transitions. [2018-12-03 04:42:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:21,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-03 04:42:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:21,046 INFO L225 Difference]: With dead ends: 612 [2018-12-03 04:42:21,046 INFO L226 Difference]: Without dead ends: 343 [2018-12-03 04:42:21,047 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-03 04:42:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-03 04:42:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 294. [2018-12-03 04:42:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 441 transitions. [2018-12-03 04:42:21,054 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 441 transitions. Word has length 113 [2018-12-03 04:42:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:21,054 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 441 transitions. [2018-12-03 04:42:21,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 441 transitions. [2018-12-03 04:42:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 04:42:21,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:21,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:21,055 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:21,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:21,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1287322451, now seen corresponding path program 1 times [2018-12-03 04:42:21,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:21,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:21,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:21,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:21,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:21,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:21,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:21,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:21,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:21,100 INFO L87 Difference]: Start difference. First operand 294 states and 441 transitions. Second operand 4 states. [2018-12-03 04:42:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:21,297 INFO L93 Difference]: Finished difference Result 604 states and 913 transitions. [2018-12-03 04:42:21,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:21,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-03 04:42:21,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:21,298 INFO L225 Difference]: With dead ends: 604 [2018-12-03 04:42:21,298 INFO L226 Difference]: Without dead ends: 335 [2018-12-03 04:42:21,298 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-03 04:42:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-03 04:42:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2018-12-03 04:42:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 440 transitions. [2018-12-03 04:42:21,306 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 440 transitions. Word has length 114 [2018-12-03 04:42:21,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:21,306 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 440 transitions. [2018-12-03 04:42:21,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 440 transitions. [2018-12-03 04:42:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 04:42:21,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:21,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:21,306 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:21,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:21,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2011081572, now seen corresponding path program 1 times [2018-12-03 04:42:21,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:21,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:21,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:21,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:21,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:21,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:21,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:21,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:21,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:21,340 INFO L87 Difference]: Start difference. First operand 294 states and 440 transitions. Second operand 4 states. [2018-12-03 04:42:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:21,537 INFO L93 Difference]: Finished difference Result 604 states and 911 transitions. [2018-12-03 04:42:21,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:21,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-03 04:42:21,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:21,538 INFO L225 Difference]: With dead ends: 604 [2018-12-03 04:42:21,538 INFO L226 Difference]: Without dead ends: 335 [2018-12-03 04:42:21,538 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-03 04:42:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-03 04:42:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2018-12-03 04:42:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 439 transitions. [2018-12-03 04:42:21,546 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 439 transitions. Word has length 115 [2018-12-03 04:42:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:21,546 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 439 transitions. [2018-12-03 04:42:21,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2018-12-03 04:42:21,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 04:42:21,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:21,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:21,547 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:21,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:21,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2114530549, now seen corresponding path program 1 times [2018-12-03 04:42:21,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:21,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:21,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:21,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:21,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:21,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:21,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:21,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:21,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:21,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:21,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:21,583 INFO L87 Difference]: Start difference. First operand 294 states and 439 transitions. Second operand 4 states. [2018-12-03 04:42:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:21,765 INFO L93 Difference]: Finished difference Result 604 states and 909 transitions. [2018-12-03 04:42:21,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:21,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-03 04:42:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:21,766 INFO L225 Difference]: With dead ends: 604 [2018-12-03 04:42:21,766 INFO L226 Difference]: Without dead ends: 335 [2018-12-03 04:42:21,767 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-03 04:42:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-03 04:42:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2018-12-03 04:42:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 438 transitions. [2018-12-03 04:42:21,774 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 438 transitions. Word has length 116 [2018-12-03 04:42:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:21,775 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 438 transitions. [2018-12-03 04:42:21,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 438 transitions. [2018-12-03 04:42:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 04:42:21,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:21,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:21,775 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:21,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash 610228371, now seen corresponding path program 1 times [2018-12-03 04:42:21,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:21,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:21,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:21,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:21,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:21,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:21,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:21,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:21,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:21,822 INFO L87 Difference]: Start difference. First operand 294 states and 438 transitions. Second operand 4 states. [2018-12-03 04:42:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:21,998 INFO L93 Difference]: Finished difference Result 602 states and 905 transitions. [2018-12-03 04:42:21,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:21,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-03 04:42:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:21,999 INFO L225 Difference]: With dead ends: 602 [2018-12-03 04:42:21,999 INFO L226 Difference]: Without dead ends: 333 [2018-12-03 04:42:21,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:42:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-03 04:42:22,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 294. [2018-12-03 04:42:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 437 transitions. [2018-12-03 04:42:22,007 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 437 transitions. Word has length 116 [2018-12-03 04:42:22,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:22,007 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 437 transitions. [2018-12-03 04:42:22,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 437 transitions. [2018-12-03 04:42:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 04:42:22,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:22,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:22,008 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:22,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:22,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1668695618, now seen corresponding path program 1 times [2018-12-03 04:42:22,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:22,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:22,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:22,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:22,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:22,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:22,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:22,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:22,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:22,041 INFO L87 Difference]: Start difference. First operand 294 states and 437 transitions. Second operand 4 states. [2018-12-03 04:42:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:22,216 INFO L93 Difference]: Finished difference Result 599 states and 899 transitions. [2018-12-03 04:42:22,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:22,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-03 04:42:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:22,217 INFO L225 Difference]: With dead ends: 599 [2018-12-03 04:42:22,217 INFO L226 Difference]: Without dead ends: 330 [2018-12-03 04:42:22,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:42:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-03 04:42:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 294. [2018-12-03 04:42:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 436 transitions. [2018-12-03 04:42:22,226 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 436 transitions. Word has length 117 [2018-12-03 04:42:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:22,226 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 436 transitions. [2018-12-03 04:42:22,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 436 transitions. [2018-12-03 04:42:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 04:42:22,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:22,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:22,227 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:22,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2016215676, now seen corresponding path program 1 times [2018-12-03 04:42:22,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:22,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:22,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:22,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:22,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:22,265 INFO L87 Difference]: Start difference. First operand 294 states and 436 transitions. Second operand 4 states. [2018-12-03 04:42:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:22,435 INFO L93 Difference]: Finished difference Result 597 states and 894 transitions. [2018-12-03 04:42:22,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:22,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-03 04:42:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:22,437 INFO L225 Difference]: With dead ends: 597 [2018-12-03 04:42:22,437 INFO L226 Difference]: Without dead ends: 328 [2018-12-03 04:42:22,437 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-03 04:42:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-03 04:42:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2018-12-03 04:42:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 435 transitions. [2018-12-03 04:42:22,445 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 435 transitions. Word has length 117 [2018-12-03 04:42:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:22,445 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 435 transitions. [2018-12-03 04:42:22,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 435 transitions. [2018-12-03 04:42:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 04:42:22,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:22,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:22,446 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:22,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1432426067, now seen corresponding path program 1 times [2018-12-03 04:42:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:22,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:22,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:22,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:22,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:22,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:22,484 INFO L87 Difference]: Start difference. First operand 294 states and 435 transitions. Second operand 4 states. [2018-12-03 04:42:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:22,652 INFO L93 Difference]: Finished difference Result 597 states and 892 transitions. [2018-12-03 04:42:22,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:22,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-03 04:42:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:22,653 INFO L225 Difference]: With dead ends: 597 [2018-12-03 04:42:22,653 INFO L226 Difference]: Without dead ends: 328 [2018-12-03 04:42:22,654 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-03 04:42:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-03 04:42:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2018-12-03 04:42:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2018-12-03 04:42:22,664 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 120 [2018-12-03 04:42:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:22,664 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2018-12-03 04:42:22,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2018-12-03 04:42:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 04:42:22,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:22,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:22,665 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:22,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:22,665 INFO L82 PathProgramCache]: Analyzing trace with hash -942816935, now seen corresponding path program 1 times [2018-12-03 04:42:22,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:22,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:22,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:22,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:22,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:22,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:22,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:22,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:22,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:22,710 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand 4 states. [2018-12-03 04:42:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:22,903 INFO L93 Difference]: Finished difference Result 591 states and 881 transitions. [2018-12-03 04:42:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:22,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-03 04:42:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:22,904 INFO L225 Difference]: With dead ends: 591 [2018-12-03 04:42:22,904 INFO L226 Difference]: Without dead ends: 322 [2018-12-03 04:42:22,904 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-03 04:42:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-03 04:42:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2018-12-03 04:42:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 433 transitions. [2018-12-03 04:42:22,913 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 433 transitions. Word has length 121 [2018-12-03 04:42:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:22,913 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 433 transitions. [2018-12-03 04:42:22,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 433 transitions. [2018-12-03 04:42:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 04:42:22,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:22,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:22,914 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:22,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:22,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1042390380, now seen corresponding path program 1 times [2018-12-03 04:42:22,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:22,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:22,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:22,953 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:22,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:22,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:22,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:22,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:22,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:22,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:22,954 INFO L87 Difference]: Start difference. First operand 294 states and 433 transitions. Second operand 4 states. [2018-12-03 04:42:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:23,128 INFO L93 Difference]: Finished difference Result 591 states and 879 transitions. [2018-12-03 04:42:23,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:23,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-03 04:42:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:23,130 INFO L225 Difference]: With dead ends: 591 [2018-12-03 04:42:23,130 INFO L226 Difference]: Without dead ends: 322 [2018-12-03 04:42:23,130 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-03 04:42:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-03 04:42:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2018-12-03 04:42:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 432 transitions. [2018-12-03 04:42:23,143 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 432 transitions. Word has length 121 [2018-12-03 04:42:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:23,143 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 432 transitions. [2018-12-03 04:42:23,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 432 transitions. [2018-12-03 04:42:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 04:42:23,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:23,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:23,144 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:23,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1821394680, now seen corresponding path program 1 times [2018-12-03 04:42:23,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:23,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:23,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:23,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:23,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:23,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:23,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:23,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:23,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:23,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:23,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:23,190 INFO L87 Difference]: Start difference. First operand 294 states and 432 transitions. Second operand 4 states. [2018-12-03 04:42:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:23,364 INFO L93 Difference]: Finished difference Result 588 states and 873 transitions. [2018-12-03 04:42:23,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:23,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-03 04:42:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:23,365 INFO L225 Difference]: With dead ends: 588 [2018-12-03 04:42:23,365 INFO L226 Difference]: Without dead ends: 319 [2018-12-03 04:42:23,366 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-03 04:42:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-03 04:42:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2018-12-03 04:42:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 431 transitions. [2018-12-03 04:42:23,377 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 431 transitions. Word has length 122 [2018-12-03 04:42:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:23,378 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 431 transitions. [2018-12-03 04:42:23,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 431 transitions. [2018-12-03 04:42:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 04:42:23,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:23,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:23,379 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:23,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:23,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1595635660, now seen corresponding path program 1 times [2018-12-03 04:42:23,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:23,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:23,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:23,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:23,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:23,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:23,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:23,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:23,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:23,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:23,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:23,423 INFO L87 Difference]: Start difference. First operand 294 states and 431 transitions. Second operand 4 states. [2018-12-03 04:42:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:23,591 INFO L93 Difference]: Finished difference Result 588 states and 871 transitions. [2018-12-03 04:42:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:23,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-03 04:42:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:23,592 INFO L225 Difference]: With dead ends: 588 [2018-12-03 04:42:23,592 INFO L226 Difference]: Without dead ends: 319 [2018-12-03 04:42:23,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:42:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-03 04:42:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2018-12-03 04:42:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-03 04:42:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 430 transitions. [2018-12-03 04:42:23,601 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 430 transitions. Word has length 123 [2018-12-03 04:42:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:23,601 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 430 transitions. [2018-12-03 04:42:23,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 430 transitions. [2018-12-03 04:42:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 04:42:23,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:23,602 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:23,602 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:23,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:23,602 INFO L82 PathProgramCache]: Analyzing trace with hash -220009708, now seen corresponding path program 1 times [2018-12-03 04:42:23,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:23,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:23,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:23,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:23,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 04:42:23,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:23,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:23,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:23,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:23,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:23,641 INFO L87 Difference]: Start difference. First operand 294 states and 430 transitions. Second operand 4 states. [2018-12-03 04:42:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:23,968 INFO L93 Difference]: Finished difference Result 635 states and 944 transitions. [2018-12-03 04:42:23,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:23,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-03 04:42:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:23,971 INFO L225 Difference]: With dead ends: 635 [2018-12-03 04:42:23,971 INFO L226 Difference]: Without dead ends: 366 [2018-12-03 04:42:23,971 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-03 04:42:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-03 04:42:23,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 326. [2018-12-03 04:42:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-12-03 04:42:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 487 transitions. [2018-12-03 04:42:23,991 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 487 transitions. Word has length 123 [2018-12-03 04:42:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:23,991 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 487 transitions. [2018-12-03 04:42:23,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 487 transitions. [2018-12-03 04:42:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 04:42:23,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:23,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:42:23,992 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:23,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1519794656, now seen corresponding path program 1 times [2018-12-03 04:42:23,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:23,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:23,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:23,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:23,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:24,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:24,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:24,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:24,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:24,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:24,038 INFO L87 Difference]: Start difference. First operand 326 states and 487 transitions. Second operand 4 states. [2018-12-03 04:42:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:24,220 INFO L93 Difference]: Finished difference Result 649 states and 979 transitions. [2018-12-03 04:42:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:24,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-03 04:42:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:24,221 INFO L225 Difference]: With dead ends: 649 [2018-12-03 04:42:24,221 INFO L226 Difference]: Without dead ends: 348 [2018-12-03 04:42:24,222 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-03 04:42:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-12-03 04:42:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 326. [2018-12-03 04:42:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-12-03 04:42:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2018-12-03 04:42:24,234 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 124 [2018-12-03 04:42:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:24,235 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2018-12-03 04:42:24,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2018-12-03 04:42:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 04:42:24,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:24,235 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:24,235 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:24,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1732868330, now seen corresponding path program 1 times [2018-12-03 04:42:24,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:24,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:24,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:24,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:24,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:24,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:24,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:24,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:24,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:24,271 INFO L87 Difference]: Start difference. First operand 326 states and 486 transitions. Second operand 4 states. [2018-12-03 04:42:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:24,655 INFO L93 Difference]: Finished difference Result 737 states and 1116 transitions. [2018-12-03 04:42:24,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:24,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-03 04:42:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:24,658 INFO L225 Difference]: With dead ends: 737 [2018-12-03 04:42:24,658 INFO L226 Difference]: Without dead ends: 436 [2018-12-03 04:42:24,659 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-03 04:42:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-12-03 04:42:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 365. [2018-12-03 04:42:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-03 04:42:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 557 transitions. [2018-12-03 04:42:24,678 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 557 transitions. Word has length 124 [2018-12-03 04:42:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:24,678 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 557 transitions. [2018-12-03 04:42:24,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 557 transitions. [2018-12-03 04:42:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 04:42:24,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:24,679 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:24,679 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:24,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:24,679 INFO L82 PathProgramCache]: Analyzing trace with hash 865227089, now seen corresponding path program 1 times [2018-12-03 04:42:24,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:24,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:24,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:24,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:24,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:24,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:24,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:24,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:24,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:24,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:24,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:24,712 INFO L87 Difference]: Start difference. First operand 365 states and 557 transitions. Second operand 4 states. [2018-12-03 04:42:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:24,878 INFO L93 Difference]: Finished difference Result 732 states and 1121 transitions. [2018-12-03 04:42:24,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:24,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-03 04:42:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:24,879 INFO L225 Difference]: With dead ends: 732 [2018-12-03 04:42:24,879 INFO L226 Difference]: Without dead ends: 392 [2018-12-03 04:42:24,880 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-03 04:42:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-12-03 04:42:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 365. [2018-12-03 04:42:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-03 04:42:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 556 transitions. [2018-12-03 04:42:24,890 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 556 transitions. Word has length 125 [2018-12-03 04:42:24,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:24,890 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 556 transitions. [2018-12-03 04:42:24,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 556 transitions. [2018-12-03 04:42:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 04:42:24,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:24,891 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:24,891 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:24,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash -974076472, now seen corresponding path program 1 times [2018-12-03 04:42:24,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:24,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:24,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:24,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:24,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:24,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:24,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:24,923 INFO L87 Difference]: Start difference. First operand 365 states and 556 transitions. Second operand 4 states. [2018-12-03 04:42:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:25,170 INFO L93 Difference]: Finished difference Result 768 states and 1173 transitions. [2018-12-03 04:42:25,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:25,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-03 04:42:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:25,172 INFO L225 Difference]: With dead ends: 768 [2018-12-03 04:42:25,172 INFO L226 Difference]: Without dead ends: 428 [2018-12-03 04:42:25,172 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-03 04:42:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-03 04:42:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 364. [2018-12-03 04:42:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 04:42:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 555 transitions. [2018-12-03 04:42:25,184 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 555 transitions. Word has length 125 [2018-12-03 04:42:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:25,184 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 555 transitions. [2018-12-03 04:42:25,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:25,184 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 555 transitions. [2018-12-03 04:42:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 04:42:25,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:25,185 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:25,185 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:25,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1278938342, now seen corresponding path program 1 times [2018-12-03 04:42:25,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:25,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:25,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:25,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:25,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:25,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:25,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:25,226 INFO L87 Difference]: Start difference. First operand 364 states and 555 transitions. Second operand 4 states. [2018-12-03 04:42:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:25,392 INFO L93 Difference]: Finished difference Result 730 states and 1117 transitions. [2018-12-03 04:42:25,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:25,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-03 04:42:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:25,394 INFO L225 Difference]: With dead ends: 730 [2018-12-03 04:42:25,394 INFO L226 Difference]: Without dead ends: 391 [2018-12-03 04:42:25,394 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-03 04:42:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-12-03 04:42:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2018-12-03 04:42:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 04:42:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 554 transitions. [2018-12-03 04:42:25,405 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 554 transitions. Word has length 126 [2018-12-03 04:42:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:25,405 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 554 transitions. [2018-12-03 04:42:25,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 554 transitions. [2018-12-03 04:42:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 04:42:25,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:25,406 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:25,406 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:25,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1772023116, now seen corresponding path program 1 times [2018-12-03 04:42:25,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:25,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:25,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:25,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:25,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:25,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:25,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:25,444 INFO L87 Difference]: Start difference. First operand 364 states and 554 transitions. Second operand 4 states. [2018-12-03 04:42:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:25,605 INFO L93 Difference]: Finished difference Result 730 states and 1115 transitions. [2018-12-03 04:42:25,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:25,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-03 04:42:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:25,606 INFO L225 Difference]: With dead ends: 730 [2018-12-03 04:42:25,606 INFO L226 Difference]: Without dead ends: 391 [2018-12-03 04:42:25,606 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-03 04:42:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-12-03 04:42:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2018-12-03 04:42:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 04:42:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2018-12-03 04:42:25,617 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 127 [2018-12-03 04:42:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:25,618 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2018-12-03 04:42:25,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2018-12-03 04:42:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 04:42:25,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:25,618 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:25,618 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:25,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:25,618 INFO L82 PathProgramCache]: Analyzing trace with hash 430719745, now seen corresponding path program 1 times [2018-12-03 04:42:25,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:25,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:25,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:25,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:25,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:25,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:25,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:25,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:25,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:25,654 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 4 states. [2018-12-03 04:42:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:25,805 INFO L93 Difference]: Finished difference Result 720 states and 1101 transitions. [2018-12-03 04:42:25,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:25,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-03 04:42:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:25,806 INFO L225 Difference]: With dead ends: 720 [2018-12-03 04:42:25,806 INFO L226 Difference]: Without dead ends: 381 [2018-12-03 04:42:25,806 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-03 04:42:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-12-03 04:42:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 364. [2018-12-03 04:42:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 04:42:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 552 transitions. [2018-12-03 04:42:25,817 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 552 transitions. Word has length 128 [2018-12-03 04:42:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:25,817 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 552 transitions. [2018-12-03 04:42:25,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 552 transitions. [2018-12-03 04:42:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 04:42:25,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:25,818 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, 1] [2018-12-03 04:42:25,818 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:25,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash -914002453, now seen corresponding path program 1 times [2018-12-03 04:42:25,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:25,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:25,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:42:25,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:25,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:42:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:42:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:42:25,845 INFO L87 Difference]: Start difference. First operand 364 states and 552 transitions. Second operand 3 states. [2018-12-03 04:42:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:25,900 INFO L93 Difference]: Finished difference Result 1038 states and 1595 transitions. [2018-12-03 04:42:25,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:42:25,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-12-03 04:42:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:25,901 INFO L225 Difference]: With dead ends: 1038 [2018-12-03 04:42:25,901 INFO L226 Difference]: Without dead ends: 699 [2018-12-03 04:42:25,902 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-03 04:42:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-12-03 04:42:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2018-12-03 04:42:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-12-03 04:42:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2018-12-03 04:42:25,923 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 129 [2018-12-03 04:42:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:25,923 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2018-12-03 04:42:25,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:42:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2018-12-03 04:42:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 04:42:25,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:25,924 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, 1, 1, 1] [2018-12-03 04:42:25,924 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:25,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash 699750052, now seen corresponding path program 1 times [2018-12-03 04:42:25,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:25,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:25,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:25,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:25,956 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-03 04:42:25,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:25,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:25,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:25,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:25,957 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2018-12-03 04:42:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:26,211 INFO L93 Difference]: Finished difference Result 1585 states and 2412 transitions. [2018-12-03 04:42:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:26,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-12-03 04:42:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:26,213 INFO L225 Difference]: With dead ends: 1585 [2018-12-03 04:42:26,213 INFO L226 Difference]: Without dead ends: 913 [2018-12-03 04:42:26,214 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-03 04:42:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-12-03 04:42:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 775. [2018-12-03 04:42:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-12-03 04:42:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1197 transitions. [2018-12-03 04:42:26,236 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1197 transitions. Word has length 131 [2018-12-03 04:42:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:26,237 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 1197 transitions. [2018-12-03 04:42:26,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1197 transitions. [2018-12-03 04:42:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 04:42:26,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:26,238 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, 1, 1, 1] [2018-12-03 04:42:26,238 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:26,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:26,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1358995278, now seen corresponding path program 1 times [2018-12-03 04:42:26,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:26,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:26,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:26,274 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-03 04:42:26,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:26,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:26,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:26,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:26,275 INFO L87 Difference]: Start difference. First operand 775 states and 1197 transitions. Second operand 4 states. [2018-12-03 04:42:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:26,577 INFO L93 Difference]: Finished difference Result 1651 states and 2537 transitions. [2018-12-03 04:42:26,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:26,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-12-03 04:42:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:26,579 INFO L225 Difference]: With dead ends: 1651 [2018-12-03 04:42:26,579 INFO L226 Difference]: Without dead ends: 901 [2018-12-03 04:42:26,580 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-03 04:42:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-12-03 04:42:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 697. [2018-12-03 04:42:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-12-03 04:42:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2018-12-03 04:42:26,605 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 132 [2018-12-03 04:42:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:26,605 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2018-12-03 04:42:26,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2018-12-03 04:42:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 04:42:26,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:26,606 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, 1, 1, 1, 1, 1] [2018-12-03 04:42:26,606 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:26,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash -609309176, now seen corresponding path program 1 times [2018-12-03 04:42:26,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:26,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:26,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:26,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:26,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:26,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:26,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:26,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:26,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:26,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:26,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:26,659 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2018-12-03 04:42:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:26,840 INFO L93 Difference]: Finished difference Result 1401 states and 2126 transitions. [2018-12-03 04:42:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:26,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-12-03 04:42:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:26,841 INFO L225 Difference]: With dead ends: 1401 [2018-12-03 04:42:26,841 INFO L226 Difference]: Without dead ends: 729 [2018-12-03 04:42:26,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:42:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-12-03 04:42:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2018-12-03 04:42:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-12-03 04:42:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1061 transitions. [2018-12-03 04:42:26,864 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1061 transitions. Word has length 133 [2018-12-03 04:42:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:26,865 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 1061 transitions. [2018-12-03 04:42:26,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1061 transitions. [2018-12-03 04:42:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 04:42:26,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:26,865 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:26,865 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:26,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1516600717, now seen corresponding path program 1 times [2018-12-03 04:42:26,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:26,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:26,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:26,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:26,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 04:42:26,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:26,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:26,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:26,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:26,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:26,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:26,898 INFO L87 Difference]: Start difference. First operand 703 states and 1061 transitions. Second operand 4 states. [2018-12-03 04:42:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:27,073 INFO L93 Difference]: Finished difference Result 1415 states and 2140 transitions. [2018-12-03 04:42:27,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:27,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-03 04:42:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:27,075 INFO L225 Difference]: With dead ends: 1415 [2018-12-03 04:42:27,075 INFO L226 Difference]: Without dead ends: 737 [2018-12-03 04:42:27,076 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-03 04:42:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-12-03 04:42:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 703. [2018-12-03 04:42:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-12-03 04:42:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1059 transitions. [2018-12-03 04:42:27,108 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1059 transitions. Word has length 138 [2018-12-03 04:42:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:27,108 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 1059 transitions. [2018-12-03 04:42:27,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1059 transitions. [2018-12-03 04:42:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 04:42:27,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:27,109 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, 1, 1, 1, 1, 1] [2018-12-03 04:42:27,110 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:27,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:27,110 INFO L82 PathProgramCache]: Analyzing trace with hash 907229310, now seen corresponding path program 1 times [2018-12-03 04:42:27,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:27,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:27,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:27,155 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-03 04:42:27,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:27,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:27,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:27,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:27,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:27,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:27,156 INFO L87 Difference]: Start difference. First operand 703 states and 1059 transitions. Second operand 4 states. [2018-12-03 04:42:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:27,371 INFO L93 Difference]: Finished difference Result 1507 states and 2286 transitions. [2018-12-03 04:42:27,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:27,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-03 04:42:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:27,373 INFO L225 Difference]: With dead ends: 1507 [2018-12-03 04:42:27,373 INFO L226 Difference]: Without dead ends: 829 [2018-12-03 04:42:27,373 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-03 04:42:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-12-03 04:42:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 759. [2018-12-03 04:42:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-03 04:42:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1157 transitions. [2018-12-03 04:42:27,410 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1157 transitions. Word has length 138 [2018-12-03 04:42:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:27,411 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1157 transitions. [2018-12-03 04:42:27,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1157 transitions. [2018-12-03 04:42:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 04:42:27,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:27,411 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:27,412 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:27,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1148557886, now seen corresponding path program 1 times [2018-12-03 04:42:27,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:27,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:27,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 04:42:27,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:27,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:27,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:27,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:27,453 INFO L87 Difference]: Start difference. First operand 759 states and 1157 transitions. Second operand 4 states. [2018-12-03 04:42:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:27,654 INFO L93 Difference]: Finished difference Result 1523 states and 2328 transitions. [2018-12-03 04:42:27,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:27,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-03 04:42:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:27,655 INFO L225 Difference]: With dead ends: 1523 [2018-12-03 04:42:27,655 INFO L226 Difference]: Without dead ends: 789 [2018-12-03 04:42:27,656 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-03 04:42:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-12-03 04:42:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 759. [2018-12-03 04:42:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-03 04:42:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1155 transitions. [2018-12-03 04:42:27,680 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1155 transitions. Word has length 139 [2018-12-03 04:42:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:27,680 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1155 transitions. [2018-12-03 04:42:27,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1155 transitions. [2018-12-03 04:42:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 04:42:27,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:27,681 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:27,681 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:27,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:27,681 INFO L82 PathProgramCache]: Analyzing trace with hash -6828579, now seen corresponding path program 1 times [2018-12-03 04:42:27,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:27,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:27,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:27,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:27,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:27,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:27,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:27,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:27,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:27,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:27,715 INFO L87 Difference]: Start difference. First operand 759 states and 1155 transitions. Second operand 4 states. [2018-12-03 04:42:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:27,958 INFO L93 Difference]: Finished difference Result 1697 states and 2593 transitions. [2018-12-03 04:42:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:27,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-03 04:42:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:27,960 INFO L225 Difference]: With dead ends: 1697 [2018-12-03 04:42:27,960 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 04:42:27,961 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-03 04:42:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 04:42:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 783. [2018-12-03 04:42:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-03 04:42:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1189 transitions. [2018-12-03 04:42:27,986 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1189 transitions. Word has length 139 [2018-12-03 04:42:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:27,986 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1189 transitions. [2018-12-03 04:42:27,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1189 transitions. [2018-12-03 04:42:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 04:42:27,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:27,987 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:27,987 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:27,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash 15016410, now seen corresponding path program 1 times [2018-12-03 04:42:27,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:27,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:27,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:28,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:28,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:28,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:28,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:28,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:28,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:28,034 INFO L87 Difference]: Start difference. First operand 783 states and 1189 transitions. Second operand 4 states. [2018-12-03 04:42:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:28,318 INFO L93 Difference]: Finished difference Result 1721 states and 2625 transitions. [2018-12-03 04:42:28,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:28,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-03 04:42:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:28,321 INFO L225 Difference]: With dead ends: 1721 [2018-12-03 04:42:28,321 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 04:42:28,322 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-03 04:42:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 04:42:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 785. [2018-12-03 04:42:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-12-03 04:42:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1191 transitions. [2018-12-03 04:42:28,348 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1191 transitions. Word has length 140 [2018-12-03 04:42:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:28,349 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 1191 transitions. [2018-12-03 04:42:28,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1191 transitions. [2018-12-03 04:42:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 04:42:28,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:28,350 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:28,350 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:28,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1245148888, now seen corresponding path program 1 times [2018-12-03 04:42:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:28,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:28,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:28,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:28,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:28,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:28,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:28,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:28,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:28,382 INFO L87 Difference]: Start difference. First operand 785 states and 1191 transitions. Second operand 4 states. [2018-12-03 04:42:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:28,639 INFO L93 Difference]: Finished difference Result 1723 states and 2625 transitions. [2018-12-03 04:42:28,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:28,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-03 04:42:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:28,640 INFO L225 Difference]: With dead ends: 1723 [2018-12-03 04:42:28,640 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 04:42:28,641 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-03 04:42:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 04:42:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 787. [2018-12-03 04:42:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-12-03 04:42:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1193 transitions. [2018-12-03 04:42:28,668 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1193 transitions. Word has length 141 [2018-12-03 04:42:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:28,668 INFO L480 AbstractCegarLoop]: Abstraction has 787 states and 1193 transitions. [2018-12-03 04:42:28,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1193 transitions. [2018-12-03 04:42:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 04:42:28,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:28,669 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:28,669 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:28,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1277487861, now seen corresponding path program 1 times [2018-12-03 04:42:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:28,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:28,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:28,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:28,698 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:28,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:28,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:28,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:28,699 INFO L87 Difference]: Start difference. First operand 787 states and 1193 transitions. Second operand 4 states. [2018-12-03 04:42:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:28,962 INFO L93 Difference]: Finished difference Result 1705 states and 2601 transitions. [2018-12-03 04:42:28,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:28,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-03 04:42:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:28,964 INFO L225 Difference]: With dead ends: 1705 [2018-12-03 04:42:28,964 INFO L226 Difference]: Without dead ends: 943 [2018-12-03 04:42:28,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:42:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-03 04:42:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 789. [2018-12-03 04:42:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-03 04:42:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1195 transitions. [2018-12-03 04:42:28,994 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1195 transitions. Word has length 142 [2018-12-03 04:42:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:28,994 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1195 transitions. [2018-12-03 04:42:28,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1195 transitions. [2018-12-03 04:42:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 04:42:28,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:28,995 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:28,995 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:28,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:28,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1974369053, now seen corresponding path program 1 times [2018-12-03 04:42:28,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:28,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:28,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:28,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:28,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:29,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:29,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:29,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:29,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:29,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:29,028 INFO L87 Difference]: Start difference. First operand 789 states and 1195 transitions. Second operand 4 states. [2018-12-03 04:42:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:29,310 INFO L93 Difference]: Finished difference Result 1727 states and 2625 transitions. [2018-12-03 04:42:29,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:29,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-03 04:42:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:29,312 INFO L225 Difference]: With dead ends: 1727 [2018-12-03 04:42:29,312 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 04:42:29,313 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-03 04:42:29,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 04:42:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2018-12-03 04:42:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-03 04:42:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1193 transitions. [2018-12-03 04:42:29,342 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1193 transitions. Word has length 146 [2018-12-03 04:42:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:29,342 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1193 transitions. [2018-12-03 04:42:29,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1193 transitions. [2018-12-03 04:42:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 04:42:29,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:29,343 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:29,343 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:29,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash -849196140, now seen corresponding path program 1 times [2018-12-03 04:42:29,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:29,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:29,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:29,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:29,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:29,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:29,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:29,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:29,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:29,380 INFO L87 Difference]: Start difference. First operand 789 states and 1193 transitions. Second operand 4 states. [2018-12-03 04:42:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:29,659 INFO L93 Difference]: Finished difference Result 1727 states and 2621 transitions. [2018-12-03 04:42:29,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:29,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-03 04:42:29,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:29,661 INFO L225 Difference]: With dead ends: 1727 [2018-12-03 04:42:29,661 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 04:42:29,662 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-03 04:42:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 04:42:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2018-12-03 04:42:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-03 04:42:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1191 transitions. [2018-12-03 04:42:29,690 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1191 transitions. Word has length 147 [2018-12-03 04:42:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:29,690 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1191 transitions. [2018-12-03 04:42:29,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1191 transitions. [2018-12-03 04:42:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 04:42:29,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:29,691 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:29,691 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:29,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:29,691 INFO L82 PathProgramCache]: Analyzing trace with hash 224363614, now seen corresponding path program 1 times [2018-12-03 04:42:29,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:29,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:29,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:29,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:29,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:29,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:29,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:29,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:29,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:29,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:29,723 INFO L87 Difference]: Start difference. First operand 789 states and 1191 transitions. Second operand 4 states. [2018-12-03 04:42:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:30,021 INFO L93 Difference]: Finished difference Result 1727 states and 2617 transitions. [2018-12-03 04:42:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:30,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-03 04:42:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:30,023 INFO L225 Difference]: With dead ends: 1727 [2018-12-03 04:42:30,023 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 04:42:30,023 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-03 04:42:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 04:42:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2018-12-03 04:42:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-03 04:42:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1189 transitions. [2018-12-03 04:42:30,052 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1189 transitions. Word has length 148 [2018-12-03 04:42:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:30,052 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1189 transitions. [2018-12-03 04:42:30,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1189 transitions. [2018-12-03 04:42:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 04:42:30,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:30,053 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:30,053 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:30,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash -302084561, now seen corresponding path program 1 times [2018-12-03 04:42:30,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:30,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:30,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:30,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:30,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:30,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:30,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:30,084 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:30,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:30,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:30,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:30,084 INFO L87 Difference]: Start difference. First operand 789 states and 1189 transitions. Second operand 4 states. [2018-12-03 04:42:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:30,354 INFO L93 Difference]: Finished difference Result 1707 states and 2589 transitions. [2018-12-03 04:42:30,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:30,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-03 04:42:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:30,355 INFO L225 Difference]: With dead ends: 1707 [2018-12-03 04:42:30,355 INFO L226 Difference]: Without dead ends: 943 [2018-12-03 04:42:30,356 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-03 04:42:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-03 04:42:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 759. [2018-12-03 04:42:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-03 04:42:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1147 transitions. [2018-12-03 04:42:30,387 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1147 transitions. Word has length 149 [2018-12-03 04:42:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:30,387 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1147 transitions. [2018-12-03 04:42:30,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1147 transitions. [2018-12-03 04:42:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 04:42:30,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:30,388 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:30,388 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:30,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1649320259, now seen corresponding path program 1 times [2018-12-03 04:42:30,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:30,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:30,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:30,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:30,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:30,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:30,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:30,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:30,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:30,421 INFO L87 Difference]: Start difference. First operand 759 states and 1147 transitions. Second operand 4 states. [2018-12-03 04:42:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:30,661 INFO L93 Difference]: Finished difference Result 1677 states and 2545 transitions. [2018-12-03 04:42:30,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:30,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-03 04:42:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:30,663 INFO L225 Difference]: With dead ends: 1677 [2018-12-03 04:42:30,663 INFO L226 Difference]: Without dead ends: 943 [2018-12-03 04:42:30,663 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-03 04:42:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-03 04:42:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 815. [2018-12-03 04:42:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-12-03 04:42:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1237 transitions. [2018-12-03 04:42:30,694 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1237 transitions. Word has length 149 [2018-12-03 04:42:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:30,695 INFO L480 AbstractCegarLoop]: Abstraction has 815 states and 1237 transitions. [2018-12-03 04:42:30,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1237 transitions. [2018-12-03 04:42:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 04:42:30,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:30,695 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:30,695 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:30,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1348233862, now seen corresponding path program 1 times [2018-12-03 04:42:30,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:30,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:30,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:30,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:30,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:30,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:30,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:30,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:30,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:30,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:30,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:30,729 INFO L87 Difference]: Start difference. First operand 815 states and 1237 transitions. Second operand 4 states. [2018-12-03 04:42:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:30,959 INFO L93 Difference]: Finished difference Result 1717 states and 2607 transitions. [2018-12-03 04:42:30,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:30,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-03 04:42:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:30,960 INFO L225 Difference]: With dead ends: 1717 [2018-12-03 04:42:30,960 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 04:42:30,961 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-03 04:42:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 04:42:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 817. [2018-12-03 04:42:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-03 04:42:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1239 transitions. [2018-12-03 04:42:30,992 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1239 transitions. Word has length 150 [2018-12-03 04:42:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:30,992 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1239 transitions. [2018-12-03 04:42:30,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1239 transitions. [2018-12-03 04:42:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 04:42:30,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:30,993 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:30,993 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:30,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1017694567, now seen corresponding path program 1 times [2018-12-03 04:42:30,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:30,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:30,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:30,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:30,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-03 04:42:31,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:31,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:31,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:31,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:31,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:31,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:31,028 INFO L87 Difference]: Start difference. First operand 817 states and 1239 transitions. Second operand 4 states. [2018-12-03 04:42:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:31,269 INFO L93 Difference]: Finished difference Result 1719 states and 2607 transitions. [2018-12-03 04:42:31,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:31,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-03 04:42:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:31,270 INFO L225 Difference]: With dead ends: 1719 [2018-12-03 04:42:31,270 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 04:42:31,271 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-03 04:42:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 04:42:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 817. [2018-12-03 04:42:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-03 04:42:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1237 transitions. [2018-12-03 04:42:31,305 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1237 transitions. Word has length 152 [2018-12-03 04:42:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:31,305 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1237 transitions. [2018-12-03 04:42:31,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1237 transitions. [2018-12-03 04:42:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 04:42:31,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:31,306 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:31,306 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:31,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:31,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1892666934, now seen corresponding path program 1 times [2018-12-03 04:42:31,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:31,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:31,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:31,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:31,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-03 04:42:31,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:31,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:31,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:31,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:31,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:31,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:31,338 INFO L87 Difference]: Start difference. First operand 817 states and 1237 transitions. Second operand 4 states. [2018-12-03 04:42:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:31,579 INFO L93 Difference]: Finished difference Result 1715 states and 2599 transitions. [2018-12-03 04:42:31,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:31,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-03 04:42:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:31,581 INFO L225 Difference]: With dead ends: 1715 [2018-12-03 04:42:31,581 INFO L226 Difference]: Without dead ends: 923 [2018-12-03 04:42:31,582 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-03 04:42:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-03 04:42:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 817. [2018-12-03 04:42:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-03 04:42:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1235 transitions. [2018-12-03 04:42:31,629 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1235 transitions. Word has length 153 [2018-12-03 04:42:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:31,629 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1235 transitions. [2018-12-03 04:42:31,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1235 transitions. [2018-12-03 04:42:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 04:42:31,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:31,630 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:31,630 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:31,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:31,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2107713211, now seen corresponding path program 1 times [2018-12-03 04:42:31,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:31,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:31,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:31,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:31,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:31,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:31,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:31,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:31,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:31,681 INFO L87 Difference]: Start difference. First operand 817 states and 1235 transitions. Second operand 4 states. [2018-12-03 04:42:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:31,918 INFO L93 Difference]: Finished difference Result 1709 states and 2587 transitions. [2018-12-03 04:42:31,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:31,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-03 04:42:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:31,919 INFO L225 Difference]: With dead ends: 1709 [2018-12-03 04:42:31,919 INFO L226 Difference]: Without dead ends: 917 [2018-12-03 04:42:31,920 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-03 04:42:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-03 04:42:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 823. [2018-12-03 04:42:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-03 04:42:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1245 transitions. [2018-12-03 04:42:31,953 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1245 transitions. Word has length 153 [2018-12-03 04:42:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:31,953 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1245 transitions. [2018-12-03 04:42:31,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1245 transitions. [2018-12-03 04:42:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 04:42:31,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:31,954 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:31,954 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:31,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:31,954 INFO L82 PathProgramCache]: Analyzing trace with hash -494111799, now seen corresponding path program 1 times [2018-12-03 04:42:31,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:31,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:31,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:31,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:31,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-03 04:42:31,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:31,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:31,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:31,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:31,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:31,997 INFO L87 Difference]: Start difference. First operand 823 states and 1245 transitions. Second operand 4 states. [2018-12-03 04:42:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:32,225 INFO L93 Difference]: Finished difference Result 1691 states and 2558 transitions. [2018-12-03 04:42:32,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:32,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-03 04:42:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:32,227 INFO L225 Difference]: With dead ends: 1691 [2018-12-03 04:42:32,227 INFO L226 Difference]: Without dead ends: 893 [2018-12-03 04:42:32,228 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-03 04:42:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-03 04:42:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2018-12-03 04:42:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-03 04:42:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1243 transitions. [2018-12-03 04:42:32,277 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1243 transitions. Word has length 153 [2018-12-03 04:42:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:32,278 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1243 transitions. [2018-12-03 04:42:32,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1243 transitions. [2018-12-03 04:42:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 04:42:32,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:32,278 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:32,279 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:32,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2089105774, now seen corresponding path program 1 times [2018-12-03 04:42:32,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:32,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:32,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:32,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:32,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-03 04:42:32,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:32,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:32,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:32,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:32,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:32,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:32,315 INFO L87 Difference]: Start difference. First operand 823 states and 1243 transitions. Second operand 4 states. [2018-12-03 04:42:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:32,572 INFO L93 Difference]: Finished difference Result 1691 states and 2554 transitions. [2018-12-03 04:42:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:32,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-03 04:42:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:32,574 INFO L225 Difference]: With dead ends: 1691 [2018-12-03 04:42:32,574 INFO L226 Difference]: Without dead ends: 893 [2018-12-03 04:42:32,575 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-03 04:42:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-03 04:42:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2018-12-03 04:42:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-03 04:42:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1241 transitions. [2018-12-03 04:42:32,622 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1241 transitions. Word has length 154 [2018-12-03 04:42:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:32,623 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1241 transitions. [2018-12-03 04:42:32,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1241 transitions. [2018-12-03 04:42:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 04:42:32,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:32,624 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:32,624 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:32,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1117409732, now seen corresponding path program 1 times [2018-12-03 04:42:32,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:32,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:32,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-03 04:42:32,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:32,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:32,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:32,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:32,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:32,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:32,664 INFO L87 Difference]: Start difference. First operand 823 states and 1241 transitions. Second operand 4 states. [2018-12-03 04:42:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:32,917 INFO L93 Difference]: Finished difference Result 1691 states and 2550 transitions. [2018-12-03 04:42:32,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:32,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-03 04:42:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:32,919 INFO L225 Difference]: With dead ends: 1691 [2018-12-03 04:42:32,919 INFO L226 Difference]: Without dead ends: 893 [2018-12-03 04:42:32,920 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-03 04:42:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-03 04:42:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2018-12-03 04:42:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-03 04:42:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1239 transitions. [2018-12-03 04:42:32,953 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1239 transitions. Word has length 155 [2018-12-03 04:42:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:32,953 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1239 transitions. [2018-12-03 04:42:32,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1239 transitions. [2018-12-03 04:42:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 04:42:32,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:32,954 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:32,954 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:32,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -833714621, now seen corresponding path program 1 times [2018-12-03 04:42:32,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:32,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:32,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:32,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:32,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:33,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:33,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:33,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:33,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:33,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:33,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:33,006 INFO L87 Difference]: Start difference. First operand 823 states and 1239 transitions. Second operand 4 states. [2018-12-03 04:42:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:33,268 INFO L93 Difference]: Finished difference Result 1741 states and 2621 transitions. [2018-12-03 04:42:33,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:33,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-03 04:42:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:33,269 INFO L225 Difference]: With dead ends: 1741 [2018-12-03 04:42:33,269 INFO L226 Difference]: Without dead ends: 943 [2018-12-03 04:42:33,270 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-03 04:42:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-03 04:42:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 823. [2018-12-03 04:42:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-03 04:42:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1237 transitions. [2018-12-03 04:42:33,305 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1237 transitions. Word has length 156 [2018-12-03 04:42:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:33,305 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1237 transitions. [2018-12-03 04:42:33,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1237 transitions. [2018-12-03 04:42:33,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 04:42:33,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:33,306 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:33,306 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:33,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash -586582830, now seen corresponding path program 1 times [2018-12-03 04:42:33,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:33,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:33,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:33,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:33,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:33,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:33,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:33,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:33,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:33,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:33,345 INFO L87 Difference]: Start difference. First operand 823 states and 1237 transitions. Second operand 4 states. [2018-12-03 04:42:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:33,577 INFO L93 Difference]: Finished difference Result 1715 states and 2579 transitions. [2018-12-03 04:42:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:33,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-03 04:42:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:33,578 INFO L225 Difference]: With dead ends: 1715 [2018-12-03 04:42:33,578 INFO L226 Difference]: Without dead ends: 917 [2018-12-03 04:42:33,578 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-03 04:42:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-03 04:42:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 825. [2018-12-03 04:42:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-03 04:42:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1239 transitions. [2018-12-03 04:42:33,614 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1239 transitions. Word has length 156 [2018-12-03 04:42:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:33,614 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1239 transitions. [2018-12-03 04:42:33,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1239 transitions. [2018-12-03 04:42:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 04:42:33,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:33,615 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:33,615 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:33,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:33,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1612541321, now seen corresponding path program 1 times [2018-12-03 04:42:33,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:33,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:33,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-03 04:42:33,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:33,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:33,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:33,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:33,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:33,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:33,648 INFO L87 Difference]: Start difference. First operand 825 states and 1239 transitions. Second operand 4 states. [2018-12-03 04:42:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:33,871 INFO L93 Difference]: Finished difference Result 1675 states and 2522 transitions. [2018-12-03 04:42:33,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:33,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-03 04:42:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:33,871 INFO L225 Difference]: With dead ends: 1675 [2018-12-03 04:42:33,872 INFO L226 Difference]: Without dead ends: 875 [2018-12-03 04:42:33,872 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-03 04:42:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-12-03 04:42:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 825. [2018-12-03 04:42:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-03 04:42:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1237 transitions. [2018-12-03 04:42:33,908 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1237 transitions. Word has length 156 [2018-12-03 04:42:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:33,908 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1237 transitions. [2018-12-03 04:42:33,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1237 transitions. [2018-12-03 04:42:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 04:42:33,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:33,909 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-12-03 04:42:33,909 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:33,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:33,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1834262860, now seen corresponding path program 1 times [2018-12-03 04:42:33,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:33,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:33,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:33,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:33,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:33,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:33,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:33,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:33,947 INFO L87 Difference]: Start difference. First operand 825 states and 1237 transitions. Second operand 4 states. [2018-12-03 04:42:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:34,184 INFO L93 Difference]: Finished difference Result 1727 states and 2587 transitions. [2018-12-03 04:42:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:34,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-03 04:42:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:34,185 INFO L225 Difference]: With dead ends: 1727 [2018-12-03 04:42:34,185 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 04:42:34,186 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-03 04:42:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 04:42:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 825. [2018-12-03 04:42:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-03 04:42:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1235 transitions. [2018-12-03 04:42:34,222 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1235 transitions. Word has length 157 [2018-12-03 04:42:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:34,222 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1235 transitions. [2018-12-03 04:42:34,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1235 transitions. [2018-12-03 04:42:34,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 04:42:34,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:34,223 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:34,223 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:34,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:34,223 INFO L82 PathProgramCache]: Analyzing trace with hash 654059408, now seen corresponding path program 1 times [2018-12-03 04:42:34,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:34,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:34,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:34,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:34,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:34,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:34,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:34,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:34,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:34,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:34,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:34,279 INFO L87 Difference]: Start difference. First operand 825 states and 1235 transitions. Second operand 4 states. [2018-12-03 04:42:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:34,545 INFO L93 Difference]: Finished difference Result 1705 states and 2555 transitions. [2018-12-03 04:42:34,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:34,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-03 04:42:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:34,546 INFO L225 Difference]: With dead ends: 1705 [2018-12-03 04:42:34,546 INFO L226 Difference]: Without dead ends: 905 [2018-12-03 04:42:34,547 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-03 04:42:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-03 04:42:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 827. [2018-12-03 04:42:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-12-03 04:42:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1237 transitions. [2018-12-03 04:42:34,587 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1237 transitions. Word has length 157 [2018-12-03 04:42:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:34,587 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1237 transitions. [2018-12-03 04:42:34,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1237 transitions. [2018-12-03 04:42:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 04:42:34,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:34,588 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:34,588 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:34,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:34,588 INFO L82 PathProgramCache]: Analyzing trace with hash 729986191, now seen corresponding path program 1 times [2018-12-03 04:42:34,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:34,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:34,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:34,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:34,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:34,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:34,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:34,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:34,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:34,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:34,629 INFO L87 Difference]: Start difference. First operand 827 states and 1237 transitions. Second operand 4 states. [2018-12-03 04:42:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:34,893 INFO L93 Difference]: Finished difference Result 1707 states and 2555 transitions. [2018-12-03 04:42:34,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:34,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-03 04:42:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:34,894 INFO L225 Difference]: With dead ends: 1707 [2018-12-03 04:42:34,894 INFO L226 Difference]: Without dead ends: 905 [2018-12-03 04:42:34,895 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-03 04:42:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-03 04:42:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 829. [2018-12-03 04:42:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-03 04:42:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1239 transitions. [2018-12-03 04:42:34,937 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1239 transitions. Word has length 157 [2018-12-03 04:42:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:34,937 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1239 transitions. [2018-12-03 04:42:34,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1239 transitions. [2018-12-03 04:42:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 04:42:34,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:34,938 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:34,939 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:34,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:34,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1758171697, now seen corresponding path program 1 times [2018-12-03 04:42:34,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:34,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:34,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:34,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:34,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:34,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:34,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:34,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:34,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:34,988 INFO L87 Difference]: Start difference. First operand 829 states and 1239 transitions. Second operand 4 states. [2018-12-03 04:42:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:35,217 INFO L93 Difference]: Finished difference Result 1703 states and 2548 transitions. [2018-12-03 04:42:35,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:35,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-03 04:42:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:35,218 INFO L225 Difference]: With dead ends: 1703 [2018-12-03 04:42:35,218 INFO L226 Difference]: Without dead ends: 899 [2018-12-03 04:42:35,219 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-03 04:42:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-03 04:42:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 831. [2018-12-03 04:42:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-03 04:42:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1241 transitions. [2018-12-03 04:42:35,257 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1241 transitions. Word has length 158 [2018-12-03 04:42:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:35,257 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1241 transitions. [2018-12-03 04:42:35,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1241 transitions. [2018-12-03 04:42:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 04:42:35,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:35,258 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:35,258 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:35,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2095262753, now seen corresponding path program 1 times [2018-12-03 04:42:35,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:35,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:35,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:35,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:35,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 04:42:35,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:35,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:35,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:35,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:35,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:35,294 INFO L87 Difference]: Start difference. First operand 831 states and 1241 transitions. Second operand 4 states. [2018-12-03 04:42:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:35,562 INFO L93 Difference]: Finished difference Result 1733 states and 2583 transitions. [2018-12-03 04:42:35,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:35,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-03 04:42:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:35,563 INFO L225 Difference]: With dead ends: 1733 [2018-12-03 04:42:35,563 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 04:42:35,564 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-03 04:42:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 04:42:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2018-12-03 04:42:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-03 04:42:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1239 transitions. [2018-12-03 04:42:35,604 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1239 transitions. Word has length 159 [2018-12-03 04:42:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:35,604 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1239 transitions. [2018-12-03 04:42:35,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1239 transitions. [2018-12-03 04:42:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 04:42:35,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:35,605 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2018-12-03 04:42:35,605 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:35,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1068543879, now seen corresponding path program 1 times [2018-12-03 04:42:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:35,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:35,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:35,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:35,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:35,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:35,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:35,644 INFO L87 Difference]: Start difference. First operand 831 states and 1239 transitions. Second operand 4 states. [2018-12-03 04:42:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:35,890 INFO L93 Difference]: Finished difference Result 1705 states and 2544 transitions. [2018-12-03 04:42:35,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:35,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-03 04:42:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:35,891 INFO L225 Difference]: With dead ends: 1705 [2018-12-03 04:42:35,891 INFO L226 Difference]: Without dead ends: 899 [2018-12-03 04:42:35,892 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-03 04:42:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-03 04:42:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 833. [2018-12-03 04:42:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-12-03 04:42:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1241 transitions. [2018-12-03 04:42:35,932 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1241 transitions. Word has length 159 [2018-12-03 04:42:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:35,932 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1241 transitions. [2018-12-03 04:42:35,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1241 transitions. [2018-12-03 04:42:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 04:42:35,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:35,933 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:35,933 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:35,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1447175760, now seen corresponding path program 1 times [2018-12-03 04:42:35,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:35,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:35,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 04:42:35,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:35,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:35,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:35,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:35,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:35,973 INFO L87 Difference]: Start difference. First operand 833 states and 1241 transitions. Second operand 4 states. [2018-12-03 04:42:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:36,238 INFO L93 Difference]: Finished difference Result 1731 states and 2575 transitions. [2018-12-03 04:42:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:36,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-03 04:42:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:36,239 INFO L225 Difference]: With dead ends: 1731 [2018-12-03 04:42:36,239 INFO L226 Difference]: Without dead ends: 923 [2018-12-03 04:42:36,240 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-03 04:42:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-03 04:42:36,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 833. [2018-12-03 04:42:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-12-03 04:42:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1239 transitions. [2018-12-03 04:42:36,280 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1239 transitions. Word has length 160 [2018-12-03 04:42:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:36,280 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1239 transitions. [2018-12-03 04:42:36,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1239 transitions. [2018-12-03 04:42:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 04:42:36,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:36,281 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-12-03 04:42:36,281 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:36,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:36,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1152588609, now seen corresponding path program 1 times [2018-12-03 04:42:36,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:36,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:36,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:36,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:36,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:36,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:36,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:36,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:36,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:36,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:36,323 INFO L87 Difference]: Start difference. First operand 833 states and 1239 transitions. Second operand 4 states. [2018-12-03 04:42:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:36,558 INFO L93 Difference]: Finished difference Result 1725 states and 2563 transitions. [2018-12-03 04:42:36,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:36,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-03 04:42:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:36,559 INFO L225 Difference]: With dead ends: 1725 [2018-12-03 04:42:36,559 INFO L226 Difference]: Without dead ends: 917 [2018-12-03 04:42:36,560 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-03 04:42:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-03 04:42:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 833. [2018-12-03 04:42:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-12-03 04:42:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1237 transitions. [2018-12-03 04:42:36,600 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1237 transitions. Word has length 160 [2018-12-03 04:42:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:36,600 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1237 transitions. [2018-12-03 04:42:36,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1237 transitions. [2018-12-03 04:42:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 04:42:36,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:36,601 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2018-12-03 04:42:36,601 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:36,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1759648439, now seen corresponding path program 1 times [2018-12-03 04:42:36,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:36,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:36,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:36,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:36,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-03 04:42:36,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:36,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:36,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:36,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:36,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:36,638 INFO L87 Difference]: Start difference. First operand 833 states and 1237 transitions. Second operand 4 states. [2018-12-03 04:42:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:36,862 INFO L93 Difference]: Finished difference Result 1701 states and 2529 transitions. [2018-12-03 04:42:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:36,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-03 04:42:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:36,863 INFO L225 Difference]: With dead ends: 1701 [2018-12-03 04:42:36,863 INFO L226 Difference]: Without dead ends: 893 [2018-12-03 04:42:36,864 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-03 04:42:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-03 04:42:36,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 835. [2018-12-03 04:42:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-12-03 04:42:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1239 transitions. [2018-12-03 04:42:36,905 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1239 transitions. Word has length 160 [2018-12-03 04:42:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:36,905 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1239 transitions. [2018-12-03 04:42:36,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1239 transitions. [2018-12-03 04:42:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 04:42:36,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:36,906 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 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] [2018-12-03 04:42:36,906 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:36,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash -545265012, now seen corresponding path program 1 times [2018-12-03 04:42:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:36,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:36,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:36,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:36,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:36,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:36,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:36,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:36,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:36,961 INFO L87 Difference]: Start difference. First operand 835 states and 1239 transitions. Second operand 4 states. [2018-12-03 04:42:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:37,192 INFO L93 Difference]: Finished difference Result 1727 states and 2559 transitions. [2018-12-03 04:42:37,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:37,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-03 04:42:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:37,193 INFO L225 Difference]: With dead ends: 1727 [2018-12-03 04:42:37,193 INFO L226 Difference]: Without dead ends: 917 [2018-12-03 04:42:37,194 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-03 04:42:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-03 04:42:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 835. [2018-12-03 04:42:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-12-03 04:42:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1237 transitions. [2018-12-03 04:42:37,238 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1237 transitions. Word has length 163 [2018-12-03 04:42:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:37,238 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1237 transitions. [2018-12-03 04:42:37,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1237 transitions. [2018-12-03 04:42:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 04:42:37,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:37,239 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:37,240 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:37,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash 162565545, now seen corresponding path program 1 times [2018-12-03 04:42:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:37,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:37,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:37,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:37,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 04:42:37,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:37,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:37,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:37,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:37,287 INFO L87 Difference]: Start difference. First operand 835 states and 1237 transitions. Second operand 4 states. [2018-12-03 04:42:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:37,550 INFO L93 Difference]: Finished difference Result 1779 states and 2654 transitions. [2018-12-03 04:42:37,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:37,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-03 04:42:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:37,551 INFO L225 Difference]: With dead ends: 1779 [2018-12-03 04:42:37,551 INFO L226 Difference]: Without dead ends: 969 [2018-12-03 04:42:37,552 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-03 04:42:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-12-03 04:42:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 895. [2018-12-03 04:42:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-03 04:42:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1343 transitions. [2018-12-03 04:42:37,596 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1343 transitions. Word has length 163 [2018-12-03 04:42:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:37,596 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1343 transitions. [2018-12-03 04:42:37,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1343 transitions. [2018-12-03 04:42:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 04:42:37,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:37,597 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:37,597 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:37,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:37,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1934911766, now seen corresponding path program 1 times [2018-12-03 04:42:37,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:37,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:37,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:37,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:37,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:37,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:37,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:37,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:37,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:37,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:37,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:37,633 INFO L87 Difference]: Start difference. First operand 895 states and 1343 transitions. Second operand 4 states. [2018-12-03 04:42:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:37,901 INFO L93 Difference]: Finished difference Result 1835 states and 2751 transitions. [2018-12-03 04:42:37,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:37,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-03 04:42:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:37,902 INFO L225 Difference]: With dead ends: 1835 [2018-12-03 04:42:37,903 INFO L226 Difference]: Without dead ends: 965 [2018-12-03 04:42:37,903 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-03 04:42:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-12-03 04:42:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 895. [2018-12-03 04:42:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-03 04:42:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1341 transitions. [2018-12-03 04:42:37,946 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1341 transitions. Word has length 164 [2018-12-03 04:42:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:37,947 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1341 transitions. [2018-12-03 04:42:37,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1341 transitions. [2018-12-03 04:42:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 04:42:37,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:37,947 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:37,948 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:37,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:37,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2010838549, now seen corresponding path program 1 times [2018-12-03 04:42:37,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:37,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:37,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:37,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:37,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:37,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:37,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:37,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:37,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:37,995 INFO L87 Difference]: Start difference. First operand 895 states and 1341 transitions. Second operand 4 states. [2018-12-03 04:42:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:38,236 INFO L93 Difference]: Finished difference Result 1835 states and 2747 transitions. [2018-12-03 04:42:38,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:38,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-03 04:42:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:38,237 INFO L225 Difference]: With dead ends: 1835 [2018-12-03 04:42:38,237 INFO L226 Difference]: Without dead ends: 965 [2018-12-03 04:42:38,237 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-03 04:42:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-12-03 04:42:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 895. [2018-12-03 04:42:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-03 04:42:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1339 transitions. [2018-12-03 04:42:38,280 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1339 transitions. Word has length 164 [2018-12-03 04:42:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:38,280 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1339 transitions. [2018-12-03 04:42:38,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1339 transitions. [2018-12-03 04:42:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 04:42:38,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:38,281 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-12-03 04:42:38,281 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:38,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:38,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1485078165, now seen corresponding path program 1 times [2018-12-03 04:42:38,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:38,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:38,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:38,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:38,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:38,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:38,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:38,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:38,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:38,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:38,319 INFO L87 Difference]: Start difference. First operand 895 states and 1339 transitions. Second operand 4 states. [2018-12-03 04:42:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:38,576 INFO L93 Difference]: Finished difference Result 1829 states and 2736 transitions. [2018-12-03 04:42:38,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:38,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-03 04:42:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:38,577 INFO L225 Difference]: With dead ends: 1829 [2018-12-03 04:42:38,577 INFO L226 Difference]: Without dead ends: 959 [2018-12-03 04:42:38,578 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-03 04:42:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-12-03 04:42:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 895. [2018-12-03 04:42:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-03 04:42:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1337 transitions. [2018-12-03 04:42:38,621 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1337 transitions. Word has length 165 [2018-12-03 04:42:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:38,621 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1337 transitions. [2018-12-03 04:42:38,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1337 transitions. [2018-12-03 04:42:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 04:42:38,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:38,622 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:38,622 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:38,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:38,622 INFO L82 PathProgramCache]: Analyzing trace with hash -687954035, now seen corresponding path program 1 times [2018-12-03 04:42:38,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:38,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:38,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:38,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:38,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:38,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:38,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:38,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:38,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:38,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:38,662 INFO L87 Difference]: Start difference. First operand 895 states and 1337 transitions. Second operand 4 states. [2018-12-03 04:42:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:38,926 INFO L93 Difference]: Finished difference Result 1829 states and 2732 transitions. [2018-12-03 04:42:38,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:38,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-03 04:42:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:38,928 INFO L225 Difference]: With dead ends: 1829 [2018-12-03 04:42:38,928 INFO L226 Difference]: Without dead ends: 959 [2018-12-03 04:42:38,929 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-03 04:42:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-12-03 04:42:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 895. [2018-12-03 04:42:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-03 04:42:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1335 transitions. [2018-12-03 04:42:38,972 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1335 transitions. Word has length 166 [2018-12-03 04:42:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:38,973 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1335 transitions. [2018-12-03 04:42:38,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1335 transitions. [2018-12-03 04:42:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 04:42:38,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:38,973 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:38,974 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:38,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:38,974 INFO L82 PathProgramCache]: Analyzing trace with hash 462521418, now seen corresponding path program 1 times [2018-12-03 04:42:38,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:38,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:38,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:38,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:38,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-03 04:42:39,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:39,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:39,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:39,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:39,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:39,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:39,010 INFO L87 Difference]: Start difference. First operand 895 states and 1335 transitions. Second operand 4 states. [2018-12-03 04:42:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:39,263 INFO L93 Difference]: Finished difference Result 1823 states and 2721 transitions. [2018-12-03 04:42:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:39,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-03 04:42:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:39,264 INFO L225 Difference]: With dead ends: 1823 [2018-12-03 04:42:39,264 INFO L226 Difference]: Without dead ends: 953 [2018-12-03 04:42:39,265 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-03 04:42:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-12-03 04:42:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 895. [2018-12-03 04:42:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-03 04:42:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1333 transitions. [2018-12-03 04:42:39,310 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1333 transitions. Word has length 166 [2018-12-03 04:42:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:39,310 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1333 transitions. [2018-12-03 04:42:39,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1333 transitions. [2018-12-03 04:42:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 04:42:39,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:39,311 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:39,311 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:39,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:39,311 INFO L82 PathProgramCache]: Analyzing trace with hash -241294597, now seen corresponding path program 1 times [2018-12-03 04:42:39,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:39,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:39,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:39,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:39,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-03 04:42:39,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:39,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:39,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:39,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:39,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:39,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:39,344 INFO L87 Difference]: Start difference. First operand 895 states and 1333 transitions. Second operand 4 states. [2018-12-03 04:42:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:39,782 INFO L93 Difference]: Finished difference Result 1845 states and 2746 transitions. [2018-12-03 04:42:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:39,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-03 04:42:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:39,784 INFO L225 Difference]: With dead ends: 1845 [2018-12-03 04:42:39,784 INFO L226 Difference]: Without dead ends: 975 [2018-12-03 04:42:39,785 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-03 04:42:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-03 04:42:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 895. [2018-12-03 04:42:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-03 04:42:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1331 transitions. [2018-12-03 04:42:39,838 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1331 transitions. Word has length 166 [2018-12-03 04:42:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:39,838 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1331 transitions. [2018-12-03 04:42:39,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1331 transitions. [2018-12-03 04:42:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 04:42:39,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:39,839 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:39,839 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:39,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash -376508925, now seen corresponding path program 1 times [2018-12-03 04:42:39,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:39,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:39,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:39,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:39,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:39,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:39,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:39,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:39,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:39,878 INFO L87 Difference]: Start difference. First operand 895 states and 1331 transitions. Second operand 4 states. [2018-12-03 04:42:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:40,112 INFO L93 Difference]: Finished difference Result 1823 states and 2713 transitions. [2018-12-03 04:42:40,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:40,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-03 04:42:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:40,113 INFO L225 Difference]: With dead ends: 1823 [2018-12-03 04:42:40,113 INFO L226 Difference]: Without dead ends: 953 [2018-12-03 04:42:40,114 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-03 04:42:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-12-03 04:42:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 879. [2018-12-03 04:42:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-03 04:42:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1311 transitions. [2018-12-03 04:42:40,159 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1311 transitions. Word has length 167 [2018-12-03 04:42:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:40,159 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1311 transitions. [2018-12-03 04:42:40,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1311 transitions. [2018-12-03 04:42:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 04:42:40,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:40,160 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:40,160 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:40,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1336504444, now seen corresponding path program 1 times [2018-12-03 04:42:40,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:40,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:40,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:40,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:40,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-03 04:42:40,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:40,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:40,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:40,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:40,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:40,204 INFO L87 Difference]: Start difference. First operand 879 states and 1311 transitions. Second operand 4 states. [2018-12-03 04:42:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:40,486 INFO L93 Difference]: Finished difference Result 1813 states and 2702 transitions. [2018-12-03 04:42:40,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:40,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-03 04:42:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:40,487 INFO L225 Difference]: With dead ends: 1813 [2018-12-03 04:42:40,487 INFO L226 Difference]: Without dead ends: 959 [2018-12-03 04:42:40,488 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-03 04:42:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-12-03 04:42:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 879. [2018-12-03 04:42:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-03 04:42:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1309 transitions. [2018-12-03 04:42:40,534 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1309 transitions. Word has length 167 [2018-12-03 04:42:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:40,534 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1309 transitions. [2018-12-03 04:42:40,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1309 transitions. [2018-12-03 04:42:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 04:42:40,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:40,535 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:40,535 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:40,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash -738395018, now seen corresponding path program 1 times [2018-12-03 04:42:40,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:40,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:40,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:40,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:40,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-03 04:42:40,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:40,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:40,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:40,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:40,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:40,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:40,570 INFO L87 Difference]: Start difference. First operand 879 states and 1309 transitions. Second operand 4 states. [2018-12-03 04:42:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:40,846 INFO L93 Difference]: Finished difference Result 1783 states and 2662 transitions. [2018-12-03 04:42:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:40,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-03 04:42:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:40,847 INFO L225 Difference]: With dead ends: 1783 [2018-12-03 04:42:40,848 INFO L226 Difference]: Without dead ends: 929 [2018-12-03 04:42:40,849 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-03 04:42:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-12-03 04:42:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 879. [2018-12-03 04:42:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-03 04:42:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1307 transitions. [2018-12-03 04:42:40,905 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1307 transitions. Word has length 168 [2018-12-03 04:42:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:40,906 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1307 transitions. [2018-12-03 04:42:40,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1307 transitions. [2018-12-03 04:42:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 04:42:40,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:40,906 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:40,907 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:40,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash -625046328, now seen corresponding path program 1 times [2018-12-03 04:42:40,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:40,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:40,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 04:42:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:40,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:40,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:40,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:40,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:40,949 INFO L87 Difference]: Start difference. First operand 879 states and 1307 transitions. Second operand 4 states. [2018-12-03 04:42:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:41,182 INFO L93 Difference]: Finished difference Result 1803 states and 2679 transitions. [2018-12-03 04:42:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:41,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-03 04:42:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:41,183 INFO L225 Difference]: With dead ends: 1803 [2018-12-03 04:42:41,183 INFO L226 Difference]: Without dead ends: 949 [2018-12-03 04:42:41,184 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-03 04:42:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-12-03 04:42:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 881. [2018-12-03 04:42:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-12-03 04:42:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1309 transitions. [2018-12-03 04:42:41,236 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1309 transitions. Word has length 169 [2018-12-03 04:42:41,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:41,236 INFO L480 AbstractCegarLoop]: Abstraction has 881 states and 1309 transitions. [2018-12-03 04:42:41,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1309 transitions. [2018-12-03 04:42:41,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 04:42:41,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:41,237 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:41,237 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:41,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:41,237 INFO L82 PathProgramCache]: Analyzing trace with hash 610499713, now seen corresponding path program 1 times [2018-12-03 04:42:41,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:41,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:41,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:41,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:41,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-03 04:42:41,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:41,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:41,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:41,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:41,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:41,286 INFO L87 Difference]: Start difference. First operand 881 states and 1309 transitions. Second operand 4 states. [2018-12-03 04:42:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:41,498 INFO L93 Difference]: Finished difference Result 1765 states and 2630 transitions. [2018-12-03 04:42:41,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:41,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-03 04:42:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:41,499 INFO L225 Difference]: With dead ends: 1765 [2018-12-03 04:42:41,499 INFO L226 Difference]: Without dead ends: 909 [2018-12-03 04:42:41,499 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-03 04:42:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-03 04:42:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 881. [2018-12-03 04:42:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-12-03 04:42:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1307 transitions. [2018-12-03 04:42:41,547 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1307 transitions. Word has length 169 [2018-12-03 04:42:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:41,547 INFO L480 AbstractCegarLoop]: Abstraction has 881 states and 1307 transitions. [2018-12-03 04:42:41,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1307 transitions. [2018-12-03 04:42:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 04:42:41,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:41,547 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:41,548 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:41,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1461067407, now seen corresponding path program 1 times [2018-12-03 04:42:41,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:41,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:41,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:41,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:41,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-03 04:42:41,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:41,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:41,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:41,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:41,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:41,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:41,581 INFO L87 Difference]: Start difference. First operand 881 states and 1307 transitions. Second operand 4 states. [2018-12-03 04:42:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:41,823 INFO L93 Difference]: Finished difference Result 1783 states and 2654 transitions. [2018-12-03 04:42:41,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:41,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-03 04:42:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:41,824 INFO L225 Difference]: With dead ends: 1783 [2018-12-03 04:42:41,824 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 04:42:41,824 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-03 04:42:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 04:42:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 881. [2018-12-03 04:42:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-12-03 04:42:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1305 transitions. [2018-12-03 04:42:41,874 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1305 transitions. Word has length 169 [2018-12-03 04:42:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:41,874 INFO L480 AbstractCegarLoop]: Abstraction has 881 states and 1305 transitions. [2018-12-03 04:42:41,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1305 transitions. [2018-12-03 04:42:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 04:42:41,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:41,875 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:41,875 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:41,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:41,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1388667942, now seen corresponding path program 1 times [2018-12-03 04:42:41,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:41,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:41,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 04:42:41,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:42:41,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:41,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:42:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:42:41,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:42:41,966 INFO L87 Difference]: Start difference. First operand 881 states and 1305 transitions. Second operand 5 states. [2018-12-03 04:42:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:42,361 INFO L93 Difference]: Finished difference Result 1895 states and 2826 transitions. [2018-12-03 04:42:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:42:42,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-12-03 04:42:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:42,362 INFO L225 Difference]: With dead ends: 1895 [2018-12-03 04:42:42,362 INFO L226 Difference]: Without dead ends: 1039 [2018-12-03 04:42:42,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:42:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-12-03 04:42:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 947. [2018-12-03 04:42:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-12-03 04:42:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1423 transitions. [2018-12-03 04:42:42,414 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1423 transitions. Word has length 169 [2018-12-03 04:42:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:42,414 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 1423 transitions. [2018-12-03 04:42:42,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:42:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1423 transitions. [2018-12-03 04:42:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 04:42:42,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:42,415 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:42,415 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:42,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:42,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2101277887, now seen corresponding path program 1 times [2018-12-03 04:42:42,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:42,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:42,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:42,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:42,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 04:42:42,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:42,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:42,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:42,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:42,451 INFO L87 Difference]: Start difference. First operand 947 states and 1423 transitions. Second operand 4 states. [2018-12-03 04:42:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:42,698 INFO L93 Difference]: Finished difference Result 1941 states and 2911 transitions. [2018-12-03 04:42:42,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:42,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-12-03 04:42:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:42,699 INFO L225 Difference]: With dead ends: 1941 [2018-12-03 04:42:42,699 INFO L226 Difference]: Without dead ends: 1019 [2018-12-03 04:42:42,700 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-03 04:42:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-12-03 04:42:42,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 947. [2018-12-03 04:42:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-12-03 04:42:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1421 transitions. [2018-12-03 04:42:42,750 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1421 transitions. Word has length 175 [2018-12-03 04:42:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:42,750 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 1421 transitions. [2018-12-03 04:42:42,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1421 transitions. [2018-12-03 04:42:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 04:42:42,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:42,751 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:42,751 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:42,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:42,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2142063282, now seen corresponding path program 1 times [2018-12-03 04:42:42,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:42,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 04:42:42,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:42,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:42:42,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:42,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:42:42,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:42:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:42:42,794 INFO L87 Difference]: Start difference. First operand 947 states and 1421 transitions. Second operand 4 states. [2018-12-03 04:42:43,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:43,015 INFO L93 Difference]: Finished difference Result 1937 states and 2903 transitions. [2018-12-03 04:42:43,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:42:43,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-12-03 04:42:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:43,016 INFO L225 Difference]: With dead ends: 1937 [2018-12-03 04:42:43,016 INFO L226 Difference]: Without dead ends: 1015 [2018-12-03 04:42:43,017 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-03 04:42:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-12-03 04:42:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 885. [2018-12-03 04:42:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-03 04:42:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1327 transitions. [2018-12-03 04:42:43,067 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1327 transitions. Word has length 176 [2018-12-03 04:42:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:43,067 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1327 transitions. [2018-12-03 04:42:43,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:42:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1327 transitions. [2018-12-03 04:42:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 04:42:43,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:43,068 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:43,068 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:43,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash -906517241, now seen corresponding path program 1 times [2018-12-03 04:42:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:43,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:43,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:43,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:42:43,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 04:42:43,341 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-12-03 04:42:43,342 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [114], [119], [124], [129], [134], [139], [144], [149], [154], [159], [164], [169], [174], [179], [184], [187], [189], [194], [197], [199], [204], [207], [278], [281], [289], [291], [294], [302], [305], [309], [514], [519], [524], [529], [544], [549], [554], [559], [564], [570], [575], [577], [582], [587], [592], [598], [601], [605], [626], [660], [662], [674], [677], [678], [679], [681] [2018-12-03 04:42:43,365 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 04:42:43,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 04:42:43,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 04:42:43,771 INFO L272 AbstractInterpreter]: Visited 82 different actions 278 times. Merged at 67 different actions 187 times. Never widened. Performed 1965 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1965 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 118 variables. [2018-12-03 04:42:43,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:43,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 04:42:43,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:42:43,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 04:42:43,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:43,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 04:42:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:43,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:42:43,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:43,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-03 04:42:43,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:43,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:43,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-03 04:42:43,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:43,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:43,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:43,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:43,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-03 04:42:43,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:43,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:43,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-03 04:42:44,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-03 04:42:44,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-03 04:42:44,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-03 04:42:44,010 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,016 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,020 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,024 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,034 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-03 04:42:44,068 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:42:44,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:42:44,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-03 04:42:44,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-03 04:42:44,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-03 04:42:44,159 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,175 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,181 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,189 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-03 04:42:44,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:42:44,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:42:44,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 04:42:44,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:42:44,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:42:44,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 04:42:44,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-03 04:42:44,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-03 04:42:44,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-03 04:42:44,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,366 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-03 04:42:44,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:42:44,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:42:44,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 04:42:44,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:42:44,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:42:44,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 04:42:44,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-03 04:42:44,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-12-03 04:42:44,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 113 [2018-12-03 04:42:44,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-03 04:42:44,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-03 04:42:44,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-03 04:42:44,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-03 04:42:44,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-03 04:42:44,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-03 04:42:44,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-03 04:42:44,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 04:42:44,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 04:42:44,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-03 04:42:44,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-03 04:42:44,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-03 04:42:44,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-03 04:42:44,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-03 04:42:44,711 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 107 [2018-12-03 04:42:44,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 04:42:44,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 62 [2018-12-03 04:42:44,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-03 04:42:44,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 04:42:44,761 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,766 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,770 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-03 04:42:44,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-03 04:42:44,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-03 04:42:44,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:44,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-03 04:42:44,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-03 04:42:44,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 04:42:44,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:44,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-03 04:42:44,853 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:44,870 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-03 04:42:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 04:42:45,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 04:42:45,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-03 04:42:45,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-03 04:42:45,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-03 04:42:45,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-03 04:42:45,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 04:42:45,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:45,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-12-03 04:42:45,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 04:42:45,148 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:45,149 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:45,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:45,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,158 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-03 04:42:45,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,175 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-03 04:42:45,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-12-03 04:42:45,184 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:42:45,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 52 [2018-12-03 04:42:45,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:44 [2018-12-03 04:42:45,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,248 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,252 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:45,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-03 04:42:45,263 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:93 [2018-12-03 04:42:47,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:47,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:47,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:47,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:47,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 04:42:47,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-03 04:42:49,447 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:49,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:49,502 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:49,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:49,524 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:49,530 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:49,544 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:49,547 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:49,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-03 04:42:49,553 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:144, output treesize:83 [2018-12-03 04:42:51,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:51,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:51,633 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:51,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:51,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 04:42:51,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-03 04:42:53,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:53,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:53,742 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:53,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:53,753 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:53,758 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:53,786 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:53,787 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:53,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 04:42:53,795 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-03 04:42:55,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:55,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:55,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:55,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:55,908 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:55,917 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,045 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,051 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,152 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,161 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,162 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,172 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,173 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,181 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,260 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,264 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,329 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,334 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,341 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,346 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,354 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,359 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,393 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,394 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:42:56,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-03 04:42:56,404 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 9 variables, input treesize:184, output treesize:103 [2018-12-03 04:42:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 28 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:42:56,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 04:42:56,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-12-03 04:42:56,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 04:42:56,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 04:42:56,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 04:42:56,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=517, Unknown=1, NotChecked=0, Total=600 [2018-12-03 04:42:56,570 INFO L87 Difference]: Start difference. First operand 885 states and 1327 transitions. Second operand 18 states. [2018-12-03 04:43:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:00,419 INFO L93 Difference]: Finished difference Result 2423 states and 3615 transitions. [2018-12-03 04:43:00,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 04:43:00,419 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 176 [2018-12-03 04:43:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:00,423 INFO L225 Difference]: With dead ends: 2423 [2018-12-03 04:43:00,423 INFO L226 Difference]: Without dead ends: 1563 [2018-12-03 04:43:00,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 333 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=220, Invalid=1039, Unknown=1, NotChecked=0, Total=1260 [2018-12-03 04:43:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-12-03 04:43:00,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 845. [2018-12-03 04:43:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-03 04:43:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1249 transitions. [2018-12-03 04:43:00,493 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1249 transitions. Word has length 176 [2018-12-03 04:43:00,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:00,493 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1249 transitions. [2018-12-03 04:43:00,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 04:43:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1249 transitions. [2018-12-03 04:43:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 04:43:00,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:00,495 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:00,495 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:00,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:00,495 INFO L82 PathProgramCache]: Analyzing trace with hash 326812478, now seen corresponding path program 1 times [2018-12-03 04:43:00,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:43:00,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:00,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:00,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:00,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:43:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 04:43:00,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:00,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:43:00,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:43:00,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:43:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:43:00,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:43:00,548 INFO L87 Difference]: Start difference. First operand 845 states and 1249 transitions. Second operand 4 states. [2018-12-03 04:43:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:00,876 INFO L93 Difference]: Finished difference Result 1739 states and 2570 transitions. [2018-12-03 04:43:00,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:43:00,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-03 04:43:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:00,878 INFO L225 Difference]: With dead ends: 1739 [2018-12-03 04:43:00,878 INFO L226 Difference]: Without dead ends: 919 [2018-12-03 04:43:00,879 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-03 04:43:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-03 04:43:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 845. [2018-12-03 04:43:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-03 04:43:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1247 transitions. [2018-12-03 04:43:00,940 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1247 transitions. Word has length 178 [2018-12-03 04:43:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:00,940 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1247 transitions. [2018-12-03 04:43:00,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:43:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1247 transitions. [2018-12-03 04:43:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 04:43:00,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:00,941 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:00,942 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:00,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:00,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1767954585, now seen corresponding path program 1 times [2018-12-03 04:43:00,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:43:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:00,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:43:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 04:43:00,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:00,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:43:00,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:43:00,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:43:00,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:43:00,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:43:00,985 INFO L87 Difference]: Start difference. First operand 845 states and 1247 transitions. Second operand 4 states. [2018-12-03 04:43:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:01,269 INFO L93 Difference]: Finished difference Result 1739 states and 2566 transitions. [2018-12-03 04:43:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:43:01,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-03 04:43:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:01,270 INFO L225 Difference]: With dead ends: 1739 [2018-12-03 04:43:01,270 INFO L226 Difference]: Without dead ends: 919 [2018-12-03 04:43:01,271 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-03 04:43:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-03 04:43:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 845. [2018-12-03 04:43:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-03 04:43:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1245 transitions. [2018-12-03 04:43:01,331 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1245 transitions. Word has length 179 [2018-12-03 04:43:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:01,331 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1245 transitions. [2018-12-03 04:43:01,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:43:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1245 transitions. [2018-12-03 04:43:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 04:43:01,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:01,332 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:01,332 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:01,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash -248342535, now seen corresponding path program 1 times [2018-12-03 04:43:01,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:43:01,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:01,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:01,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:01,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:43:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 04:43:01,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:01,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:43:01,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:43:01,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:43:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:43:01,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:43:01,382 INFO L87 Difference]: Start difference. First operand 845 states and 1245 transitions. Second operand 4 states. [2018-12-03 04:43:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:01,646 INFO L93 Difference]: Finished difference Result 1739 states and 2562 transitions. [2018-12-03 04:43:01,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:43:01,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-12-03 04:43:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:01,648 INFO L225 Difference]: With dead ends: 1739 [2018-12-03 04:43:01,648 INFO L226 Difference]: Without dead ends: 919 [2018-12-03 04:43:01,648 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-03 04:43:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-03 04:43:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 845. [2018-12-03 04:43:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-03 04:43:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1243 transitions. [2018-12-03 04:43:01,706 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1243 transitions. Word has length 180 [2018-12-03 04:43:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:01,706 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1243 transitions. [2018-12-03 04:43:01,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:43:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1243 transitions. [2018-12-03 04:43:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 04:43:01,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:01,707 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:01,707 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:01,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:01,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2071073292, now seen corresponding path program 1 times [2018-12-03 04:43:01,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:43:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:01,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:01,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:43:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 04:43:01,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:01,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:43:01,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:43:01,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:43:01,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:43:01,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:43:01,783 INFO L87 Difference]: Start difference. First operand 845 states and 1243 transitions. Second operand 4 states. [2018-12-03 04:43:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:02,090 INFO L93 Difference]: Finished difference Result 1719 states and 2534 transitions. [2018-12-03 04:43:02,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:43:02,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-12-03 04:43:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:02,092 INFO L225 Difference]: With dead ends: 1719 [2018-12-03 04:43:02,092 INFO L226 Difference]: Without dead ends: 899 [2018-12-03 04:43:02,093 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-03 04:43:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-03 04:43:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 845. [2018-12-03 04:43:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-03 04:43:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1241 transitions. [2018-12-03 04:43:02,164 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1241 transitions. Word has length 181 [2018-12-03 04:43:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:02,165 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1241 transitions. [2018-12-03 04:43:02,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:43:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1241 transitions. [2018-12-03 04:43:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 04:43:02,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:02,165 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:02,165 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:02,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:02,166 INFO L82 PathProgramCache]: Analyzing trace with hash 328762145, now seen corresponding path program 1 times [2018-12-03 04:43:02,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:43:02,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:02,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:02,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:02,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:43:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-03 04:43:02,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:02,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:43:02,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:43:02,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:43:02,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:43:02,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:43:02,257 INFO L87 Difference]: Start difference. First operand 845 states and 1241 transitions. Second operand 5 states. [2018-12-03 04:43:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:02,667 INFO L93 Difference]: Finished difference Result 1975 states and 2944 transitions. [2018-12-03 04:43:02,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:43:02,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2018-12-03 04:43:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:02,668 INFO L225 Difference]: With dead ends: 1975 [2018-12-03 04:43:02,669 INFO L226 Difference]: Without dead ends: 1155 [2018-12-03 04:43:02,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:43:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-12-03 04:43:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 923. [2018-12-03 04:43:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-12-03 04:43:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1383 transitions. [2018-12-03 04:43:02,745 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1383 transitions. Word has length 184 [2018-12-03 04:43:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:02,745 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1383 transitions. [2018-12-03 04:43:02,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:43:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1383 transitions. [2018-12-03 04:43:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 04:43:02,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:02,746 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:02,746 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:02,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1551695247, now seen corresponding path program 1 times [2018-12-03 04:43:02,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:43:02,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:02,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:02,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:02,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:43:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-03 04:43:02,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:02,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:43:02,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:43:02,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:43:02,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:43:02,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:43:02,857 INFO L87 Difference]: Start difference. First operand 923 states and 1383 transitions. Second operand 5 states. [2018-12-03 04:43:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:03,196 INFO L93 Difference]: Finished difference Result 2043 states and 3080 transitions. [2018-12-03 04:43:03,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:43:03,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-03 04:43:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:03,197 INFO L225 Difference]: With dead ends: 2043 [2018-12-03 04:43:03,197 INFO L226 Difference]: Without dead ends: 1145 [2018-12-03 04:43:03,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:43:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-12-03 04:43:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 977. [2018-12-03 04:43:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-12-03 04:43:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1493 transitions. [2018-12-03 04:43:03,258 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1493 transitions. Word has length 185 [2018-12-03 04:43:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:03,258 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1493 transitions. [2018-12-03 04:43:03,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:43:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1493 transitions. [2018-12-03 04:43:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 04:43:03,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:03,259 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:03,259 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:03,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1844882177, now seen corresponding path program 1 times [2018-12-03 04:43:03,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:43:03,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:03,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:03,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:03,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:43:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 04:43:03,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:43:03,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 04:43:03,637 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-12-03 04:43:03,637 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [329], [331], [336], [338], [343], [348], [389], [391], [393], [396], [407], [409], [419], [421], [426], [432], [454], [456], [514], [519], [524], [529], [626], [660], [662], [674], [677], [678], [679], [681] [2018-12-03 04:43:03,639 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 04:43:03,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 04:43:03,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 04:43:03,861 INFO L272 AbstractInterpreter]: Visited 86 different actions 231 times. Merged at 69 different actions 135 times. Never widened. Performed 1663 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1663 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 8 different actions. Largest state had 137 variables. [2018-12-03 04:43:03,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:03,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 04:43:03,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:43:03,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 04:43:03,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:03,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 04:43:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:03,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:03,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:03,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-03 04:43:03,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-03 04:43:04,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-03 04:43:04,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-03 04:43:04,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-03 04:43:04,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-03 04:43:04,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-03 04:43:04,057 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,063 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,066 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,069 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,077 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-03 04:43:04,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:43:04,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:43:04,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:43:04,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:43:04,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:43:04,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:43:04,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,204 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,210 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-03 04:43:04,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:43:04,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:43:04,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 04:43:04,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:43:04,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:43:04,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 04:43:04,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-03 04:43:04,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-03 04:43:04,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-03 04:43:04,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,354 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-03 04:43:04,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:43:04,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:43:04,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 04:43:04,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:43:04,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:43:04,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 04:43:04,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:43:04,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:43:04,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 04:43:04,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 04:43:04,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-03 04:43:04,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-03 04:43:04,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-03 04:43:04,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-03 04:43:04,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-12-03 04:43:04,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,509 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-03 04:43:04,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-03 04:43:04,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-03 04:43:04,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-03 04:43:04,550 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,566 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,580 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-03 04:43:04,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-03 04:43:04,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-03 04:43:04,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-03 04:43:04,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-12-03 04:43:04,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-03 04:43:04,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-12-03 04:43:04,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 04:43:04,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-12-03 04:43:04,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 04:43:04,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-12-03 04:43:04,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-03 04:43:04,699 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,776 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,780 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,821 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,834 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:04,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 227 [2018-12-03 04:43:04,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 1 [2018-12-03 04:43:04,894 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,905 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 182 [2018-12-03 04:43:04,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 232 [2018-12-03 04:43:04,972 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 153 [2018-12-03 04:43:05,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 04:43:05,005 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 125 [2018-12-03 04:43:05,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 210 [2018-12-03 04:43:05,044 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,067 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,079 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,091 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-12-03 04:43:05,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-03 04:43:05,114 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,119 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,132 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-03 04:43:05,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-12-03 04:43:05,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-03 04:43:05,167 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2018-12-03 04:43:05,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 77 [2018-12-03 04:43:05,187 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2018-12-03 04:43:05,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-12-03 04:43:05,207 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,218 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-03 04:43:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 04:43:05,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 04:43:05,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,583 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,596 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,610 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 273 [2018-12-03 04:43:05,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:05,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 245 [2018-12-03 04:43:05,641 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,647 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 196 [2018-12-03 04:43:05,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 187 [2018-12-03 04:43:05,659 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,662 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 159 [2018-12-03 04:43:05,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 04:43:05,674 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 129 [2018-12-03 04:43:05,700 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,700 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 70 [2018-12-03 04:43:05,701 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 112 [2018-12-03 04:43:05,730 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,730 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 98 [2018-12-03 04:43:05,731 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-12-03 04:43:05,744 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,753 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,754 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,754 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,755 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,755 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,756 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-03 04:43:05,756 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,765 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 04:43:05,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 168 [2018-12-03 04:43:05,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 04:43:05,769 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,775 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,775 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 04:43:05,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-12-03 04:43:05,775 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,778 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,784 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 04:43:05,789 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 04:43:05,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 04:43:05,797 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:98 [2018-12-03 04:43:05,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-03 04:43:05,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-03 04:43:05,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,829 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-03 04:43:05,856 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-03 04:43:05,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-03 04:43:05,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-03 04:43:05,888 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-03 04:43:05,917 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,925 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-03 04:43:05,944 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-03 04:43:05,963 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-03 04:43:05,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:05,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-03 04:43:06,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-03 04:43:06,032 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-03 04:43:06,050 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,066 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,075 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,076 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 04:43:06,077 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:20 [2018-12-03 04:43:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 04:43:06,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 04:43:06,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 23 [2018-12-03 04:43:06,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 04:43:06,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 04:43:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 04:43:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-12-03 04:43:06,203 INFO L87 Difference]: Start difference. First operand 977 states and 1493 transitions. Second operand 16 states. [2018-12-03 04:43:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:11,406 INFO L93 Difference]: Finished difference Result 3379 states and 5144 transitions. [2018-12-03 04:43:11,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 04:43:11,407 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 198 [2018-12-03 04:43:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:11,411 INFO L225 Difference]: With dead ends: 3379 [2018-12-03 04:43:11,411 INFO L226 Difference]: Without dead ends: 2427 [2018-12-03 04:43:11,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 373 SyntacticMatches, 23 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 04:43:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2018-12-03 04:43:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1439. [2018-12-03 04:43:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-12-03 04:43:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2283 transitions. [2018-12-03 04:43:11,507 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2283 transitions. Word has length 198 [2018-12-03 04:43:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:11,508 INFO L480 AbstractCegarLoop]: Abstraction has 1439 states and 2283 transitions. [2018-12-03 04:43:11,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 04:43:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2283 transitions. [2018-12-03 04:43:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-03 04:43:11,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:11,509 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:11,509 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:11,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1027478594, now seen corresponding path program 1 times [2018-12-03 04:43:11,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:43:11,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:11,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:11,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:43:11,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:43:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:43:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:43:11,626 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 04:43:11,668 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24589 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-03 04:43:11,668 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24591 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-03 04:43:11,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:43:11 BoogieIcfgContainer [2018-12-03 04:43:11,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 04:43:11,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 04:43:11,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 04:43:11,726 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 04:43:11,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:12" (3/4) ... [2018-12-03 04:43:11,729 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 04:43:11,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 04:43:11,730 INFO L168 Benchmark]: Toolchain (without parser) took 60755.88 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 709.4 MB). Free memory was 956.0 MB in the beginning and 1.5 GB in the end (delta: -545.6 MB). Peak memory consumption was 163.7 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:11,730 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:43:11,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:11,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.64 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-03 04:43:11,731 INFO L168 Benchmark]: Boogie Preprocessor took 48.10 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:11,731 INFO L168 Benchmark]: RCFGBuilder took 577.85 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: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:11,731 INFO L168 Benchmark]: TraceAbstraction took 59710.16 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 551.6 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -467.9 MB). Peak memory consumption was 83.7 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:11,731 INFO L168 Benchmark]: Witness Printer took 3.03 ms. Allocated memory is still 1.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:43:11,732 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.64 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 48.10 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 577.85 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: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59710.16 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 551.6 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -467.9 MB). Peak memory consumption was 83.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.03 ms. Allocated memory is still 1.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24589 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 24591 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: 1762]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24610, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24590: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))={24597:0}, malloc(sizeof(SSL_CTX))={24612:0}, malloc(sizeof(SSL_SESSION))={24578:0}, malloc(sizeof(struct ssl3_state_st))={24602:0}, s={24597:0}, SSLv3_server_data={24590:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24597:0}, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24590:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24590:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1598] EXPR s->session [L1598] EXPR s->s3 [L1598] EXPR (s->s3)->tmp.new_cipher [L1598] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1599] COND FALSE !(! tmp___9) [L1605] ret = __VERIFIER_nondet_int() [L1606] COND FALSE !(blastFlag == 10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1609] COND FALSE !(blastFlag == 13) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1612] COND FALSE !(blastFlag == 16) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1619] COND FALSE !(ret <= 0) [L1624] s->state = 8672 [L1625] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1626] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1635] ret = __VERIFIER_nondet_int() [L1636] COND FALSE !(blastFlag == 11) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1639] COND FALSE !(blastFlag == 14) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1642] COND FALSE !(blastFlag == 17) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1649] COND FALSE !(ret <= 0) [L1654] s->state = 8448 [L1655] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1655] COND TRUE s->hit [L1656] EXPR s->s3 [L1656] (s->s3)->tmp.next_state = 8640 [L1660] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1574] COND FALSE !(blastFlag == 12) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1577] COND FALSE !(blastFlag == 15) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1762] __VERIFIER_error() VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 1 error locations. UNSAFE Result, 59.6s OverallTime, 117 OverallIterations, 7 TraceHistogramMax, 34.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28134 SDtfs, 10128 SDslu, 46971 SDs, 0 SdLazy, 29228 SolverSat, 1524 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1530 GetRequests, 934 SyntacticMatches, 186 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1439occurred in iteration=116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 116 MinimizatonAttempts, 8962 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 15637 NumberOfCodeBlocks, 15637 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 15686 ConstructedInterpolants, 317 QuantifiedInterpolants, 12933188 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1614 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 120 InterpolantComputations, 114 PerfectInterpolantSequences, 16078/17072 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-03 04:43:13,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 04:43:13,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 04:43:13,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 04:43:13,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 04:43:13,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 04:43:13,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 04:43:13,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 04:43:13,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 04:43:13,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 04:43:13,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 04:43:13,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 04:43:13,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 04:43:13,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 04:43:13,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 04:43:13,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 04:43:13,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 04:43:13,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 04:43:13,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 04:43:13,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 04:43:13,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 04:43:13,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 04:43:13,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 04:43:13,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 04:43:13,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 04:43:13,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 04:43:13,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 04:43:13,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 04:43:13,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 04:43:13,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 04:43:13,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 04:43:13,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 04:43:13,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 04:43:13,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 04:43:13,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 04:43:13,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 04:43:13,308 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 04:43:13,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 04:43:13,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 04:43:13,319 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 04:43:13,319 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 04:43:13,319 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 04:43:13,319 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 04:43:13,319 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 04:43:13,320 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 04:43:13,320 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 04:43:13,320 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 04:43:13,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 04:43:13,321 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 04:43:13,321 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 04:43:13,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 04:43:13,321 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 04:43:13,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 04:43:13,321 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 04:43:13,321 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 04:43:13,322 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 04:43:13,322 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 04:43:13,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 04:43:13,322 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 04:43:13,322 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 04:43:13,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 04:43:13,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 04:43:13,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 04:43:13,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 04:43:13,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:43:13,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 04:43:13,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 04:43:13,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 04:43:13,324 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 04:43:13,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 04:43:13,324 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 04:43:13,324 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 04:43:13,324 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_d2535ddf-437e-4f4e-adca-57c112d29e64/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 -> 0a7396ffb12cf754f13107d729c5350f83c5ce55 [2018-12-03 04:43:13,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 04:43:13,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 04:43:13,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 04:43:13,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 04:43:13,357 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 04:43:13,358 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-03 04:43:13,399 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data/51199c9f1/3626d3a9f22742caa8b572c9981986a7/FLAGa74af24c7 [2018-12-03 04:43:13,734 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 04:43:13,735 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-03 04:43:13,743 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data/51199c9f1/3626d3a9f22742caa8b572c9981986a7/FLAGa74af24c7 [2018-12-03 04:43:13,751 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2535ddf-437e-4f4e-adca-57c112d29e64/bin-2019/utaipan/data/51199c9f1/3626d3a9f22742caa8b572c9981986a7 [2018-12-03 04:43:13,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 04:43:13,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 04:43:13,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 04:43:13,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 04:43:13,757 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 04:43:13,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:43:13" (1/1) ... [2018-12-03 04:43:13,759 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 03.12 04:43:13, skipping insertion in model container [2018-12-03 04:43:13,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:43:13" (1/1) ... [2018-12-03 04:43:13,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 04:43:13,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 04:43:14,003 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:43:14,015 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 04:43:14,110 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:43:14,111 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-03 04:43:14,114 INFO L168 Benchmark]: Toolchain (without parser) took 360.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:14,115 INFO L168 Benchmark]: CDTParser took 0.17 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-03 04:43:14,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:14,117 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.17 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 358.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 40.9 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...