./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.10_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_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/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 6457dc37db4a96aff5ca373c1a8d071fc7ddce3b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/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 6457dc37db4a96aff5ca373c1a8d071fc7ddce3b ............................................................................................................................................................................ 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-02 07:50:14,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:50:14,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:50:14,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:50:14,179 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:50:14,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:50:14,181 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:50:14,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:50:14,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:50:14,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:50:14,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:50:14,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:50:14,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:50:14,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:50:14,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:50:14,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:50:14,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:50:14,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:50:14,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:50:14,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:50:14,189 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:50:14,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:50:14,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:50:14,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:50:14,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:50:14,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:50:14,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:50:14,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:50:14,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:50:14,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:50:14,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:50:14,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:50:14,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:50:14,195 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:50:14,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:50:14,196 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:50:14,196 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 07:50:14,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:50:14,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:50:14,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:50:14,204 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:50:14,204 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 07:50:14,204 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 07:50:14,204 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 07:50:14,204 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 07:50:14,204 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 07:50:14,204 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 07:50:14,205 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 07:50:14,205 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 07:50:14,205 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 07:50:14,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:50:14,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:50:14,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:50:14,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:50:14,205 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:50:14,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 07:50:14,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:50:14,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 07:50:14,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:50:14,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:50:14,206 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 07:50:14,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:50:14,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:50:14,206 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:50:14,206 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:50:14,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:50:14,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:50:14,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:50:14,207 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 07:50:14,207 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 07:50:14,207 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:50:14,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 07:50:14,207 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 07:50:14,207 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_74ac3f82-e3da-481d-9b81-76726fd8f03e/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 -> 6457dc37db4a96aff5ca373c1a8d071fc7ddce3b [2018-12-02 07:50:14,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:50:14,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:50:14,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:50:14,237 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:50:14,238 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:50:14,238 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-02 07:50:14,281 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data/ed7bf0be5/5c594853b8d841148a8daeff659fc5b5/FLAGd5a0edf18 [2018-12-02 07:50:14,776 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:50:14,776 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-02 07:50:14,784 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data/ed7bf0be5/5c594853b8d841148a8daeff659fc5b5/FLAGd5a0edf18 [2018-12-02 07:50:14,793 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data/ed7bf0be5/5c594853b8d841148a8daeff659fc5b5 [2018-12-02 07:50:14,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:50:14,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:50:14,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:50:14,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:50:14,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:50:14,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:50:14" (1/1) ... [2018-12-02 07:50:14,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fde7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:14, skipping insertion in model container [2018-12-02 07:50:14,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:50:14" (1/1) ... [2018-12-02 07:50:14,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:50:14,829 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:50:15,062 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:50:15,071 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:50:15,125 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:50:15,136 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:50:15,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15 WrapperNode [2018-12-02 07:50:15,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:50:15,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:50:15,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:50:15,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:50:15,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... [2018-12-02 07:50:15,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... [2018-12-02 07:50:15,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:50:15,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:50:15,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:50:15,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:50:15,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... [2018-12-02 07:50:15,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... [2018-12-02 07:50:15,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... [2018-12-02 07:50:15,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... [2018-12-02 07:50:15,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... [2018-12-02 07:50:15,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... [2018-12-02 07:50:15,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... [2018-12-02 07:50:15,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:50:15,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:50:15,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:50:15,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:50:15,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/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-02 07:50:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 07:50:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 07:50:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 07:50:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 07:50:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 07:50:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:50:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 07:50:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 07:50:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 07:50:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-02 07:50:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-02 07:50:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 07:50:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 07:50:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:50:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:50:15,459 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 07:50:15,459 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 07:50:15,819 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:50:15,819 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 07:50:15,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:50:15 BoogieIcfgContainer [2018-12-02 07:50:15,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:50:15,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 07:50:15,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 07:50:15,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 07:50:15,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:50:14" (1/3) ... [2018-12-02 07:50:15,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eeeec21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:50:15, skipping insertion in model container [2018-12-02 07:50:15,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:50:15" (2/3) ... [2018-12-02 07:50:15,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eeeec21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:50:15, skipping insertion in model container [2018-12-02 07:50:15,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:50:15" (3/3) ... [2018-12-02 07:50:15,825 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-02 07:50:15,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 07:50:15,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 07:50:15,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 07:50:15,874 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 07:50:15,874 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 07:50:15,875 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 07:50:15,875 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:50:15,875 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:50:15,875 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 07:50:15,875 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:50:15,875 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 07:50:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-12-02 07:50:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 07:50:15,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:15,898 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] [2018-12-02 07:50:15,900 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:15,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:15,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1806902516, now seen corresponding path program 1 times [2018-12-02 07:50:15,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:15,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:15,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:15,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:15,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:16,103 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-02 07:50:16,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:16,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:16,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:16,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:16,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:16,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:16,118 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2018-12-02 07:50:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:16,392 INFO L93 Difference]: Finished difference Result 327 states and 546 transitions. [2018-12-02 07:50:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:16,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 07:50:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:16,401 INFO L225 Difference]: With dead ends: 327 [2018-12-02 07:50:16,401 INFO L226 Difference]: Without dead ends: 166 [2018-12-02 07:50:16,404 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-02 07:50:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-02 07:50:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2018-12-02 07:50:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 07:50:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2018-12-02 07:50:16,432 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 47 [2018-12-02 07:50:16,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:16,432 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2018-12-02 07:50:16,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2018-12-02 07:50:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 07:50:16,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:16,434 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] [2018-12-02 07:50:16,434 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:16,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:16,434 INFO L82 PathProgramCache]: Analyzing trace with hash 719533870, now seen corresponding path program 1 times [2018-12-02 07:50:16,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:16,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:16,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:16,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:16,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:16,507 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-02 07:50:16,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:16,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:16,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:16,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:16,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:16,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:16,509 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2018-12-02 07:50:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:16,683 INFO L93 Difference]: Finished difference Result 290 states and 437 transitions. [2018-12-02 07:50:16,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:16,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 07:50:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:16,684 INFO L225 Difference]: With dead ends: 290 [2018-12-02 07:50:16,685 INFO L226 Difference]: Without dead ends: 166 [2018-12-02 07:50:16,685 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-02 07:50:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-02 07:50:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2018-12-02 07:50:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 07:50:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2018-12-02 07:50:16,691 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 60 [2018-12-02 07:50:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:16,692 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2018-12-02 07:50:16,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2018-12-02 07:50:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 07:50:16,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:16,693 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] [2018-12-02 07:50:16,693 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:16,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash 246730250, now seen corresponding path program 1 times [2018-12-02 07:50:16,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:16,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:16,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:16,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:16,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:50:16,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:16,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:50:16,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:16,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:50:16,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:50:16,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:50:16,785 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 5 states. [2018-12-02 07:50:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:17,086 INFO L93 Difference]: Finished difference Result 294 states and 445 transitions. [2018-12-02 07:50:17,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:50:17,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-02 07:50:17,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:17,087 INFO L225 Difference]: With dead ends: 294 [2018-12-02 07:50:17,087 INFO L226 Difference]: Without dead ends: 170 [2018-12-02 07:50:17,088 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-02 07:50:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-02 07:50:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-12-02 07:50:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-02 07:50:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2018-12-02 07:50:17,093 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 61 [2018-12-02 07:50:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:17,094 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2018-12-02 07:50:17,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:50:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2018-12-02 07:50:17,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 07:50:17,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:17,095 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] [2018-12-02 07:50:17,095 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:17,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash -359930047, now seen corresponding path program 1 times [2018-12-02 07:50:17,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:17,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:17,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:17,136 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-02 07:50:17,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:17,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:17,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:17,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:17,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:17,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:17,137 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 4 states. [2018-12-02 07:50:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:17,289 INFO L93 Difference]: Finished difference Result 327 states and 485 transitions. [2018-12-02 07:50:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:17,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 07:50:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:17,290 INFO L225 Difference]: With dead ends: 327 [2018-12-02 07:50:17,290 INFO L226 Difference]: Without dead ends: 183 [2018-12-02 07:50:17,291 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-02 07:50:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-02 07:50:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2018-12-02 07:50:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-02 07:50:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2018-12-02 07:50:17,298 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 61 [2018-12-02 07:50:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:17,298 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2018-12-02 07:50:17,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2018-12-02 07:50:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 07:50:17,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:17,300 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] [2018-12-02 07:50:17,300 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:17,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2017958462, now seen corresponding path program 1 times [2018-12-02 07:50:17,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:17,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:17,355 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-02 07:50:17,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:17,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:17,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:17,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:17,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:17,356 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand 4 states. [2018-12-02 07:50:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:17,493 INFO L93 Difference]: Finished difference Result 326 states and 483 transitions. [2018-12-02 07:50:17,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:17,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 07:50:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:17,494 INFO L225 Difference]: With dead ends: 326 [2018-12-02 07:50:17,494 INFO L226 Difference]: Without dead ends: 182 [2018-12-02 07:50:17,495 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-02 07:50:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-02 07:50:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2018-12-02 07:50:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-02 07:50:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 249 transitions. [2018-12-02 07:50:17,502 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 249 transitions. Word has length 61 [2018-12-02 07:50:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:17,502 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 249 transitions. [2018-12-02 07:50:17,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 249 transitions. [2018-12-02 07:50:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 07:50:17,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:17,503 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] [2018-12-02 07:50:17,504 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:17,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1592094827, now seen corresponding path program 1 times [2018-12-02 07:50:17,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:17,550 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-02 07:50:17,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:17,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:17,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:17,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:17,551 INFO L87 Difference]: Start difference. First operand 169 states and 249 transitions. Second operand 4 states. [2018-12-02 07:50:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:17,693 INFO L93 Difference]: Finished difference Result 326 states and 482 transitions. [2018-12-02 07:50:17,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:17,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 07:50:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:17,694 INFO L225 Difference]: With dead ends: 326 [2018-12-02 07:50:17,694 INFO L226 Difference]: Without dead ends: 182 [2018-12-02 07:50:17,695 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-02 07:50:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-02 07:50:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2018-12-02 07:50:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-02 07:50:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2018-12-02 07:50:17,699 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 62 [2018-12-02 07:50:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:17,699 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2018-12-02 07:50:17,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2018-12-02 07:50:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 07:50:17,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:17,700 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] [2018-12-02 07:50:17,700 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:17,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:17,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1679775998, now seen corresponding path program 1 times [2018-12-02 07:50:17,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:17,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:17,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:17,730 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-02 07:50:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:17,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:17,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:17,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:17,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:17,731 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand 4 states. [2018-12-02 07:50:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:17,868 INFO L93 Difference]: Finished difference Result 326 states and 481 transitions. [2018-12-02 07:50:17,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:17,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 07:50:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:17,869 INFO L225 Difference]: With dead ends: 326 [2018-12-02 07:50:17,869 INFO L226 Difference]: Without dead ends: 182 [2018-12-02 07:50:17,870 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-02 07:50:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-02 07:50:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2018-12-02 07:50:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-02 07:50:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 247 transitions. [2018-12-02 07:50:17,873 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 247 transitions. Word has length 63 [2018-12-02 07:50:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:17,873 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 247 transitions. [2018-12-02 07:50:17,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 247 transitions. [2018-12-02 07:50:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 07:50:17,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:17,874 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] [2018-12-02 07:50:17,874 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:17,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:17,874 INFO L82 PathProgramCache]: Analyzing trace with hash 939026693, now seen corresponding path program 1 times [2018-12-02 07:50:17,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:17,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:17,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:17,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:17,911 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-02 07:50:17,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:17,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:17,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:17,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:17,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:17,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:17,913 INFO L87 Difference]: Start difference. First operand 169 states and 247 transitions. Second operand 4 states. [2018-12-02 07:50:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:18,063 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2018-12-02 07:50:18,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:18,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 07:50:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:18,064 INFO L225 Difference]: With dead ends: 355 [2018-12-02 07:50:18,064 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 07:50:18,065 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-02 07:50:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 07:50:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2018-12-02 07:50:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2018-12-02 07:50:18,070 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 64 [2018-12-02 07:50:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:18,070 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2018-12-02 07:50:18,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2018-12-02 07:50:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 07:50:18,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:18,071 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] [2018-12-02 07:50:18,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:18,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1518844186, now seen corresponding path program 1 times [2018-12-02 07:50:18,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:18,110 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-02 07:50:18,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:18,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:18,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:18,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:18,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:18,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:18,111 INFO L87 Difference]: Start difference. First operand 191 states and 284 transitions. Second operand 4 states. [2018-12-02 07:50:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:18,237 INFO L93 Difference]: Finished difference Result 370 states and 554 transitions. [2018-12-02 07:50:18,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:18,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 07:50:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:18,238 INFO L225 Difference]: With dead ends: 370 [2018-12-02 07:50:18,238 INFO L226 Difference]: Without dead ends: 204 [2018-12-02 07:50:18,238 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-02 07:50:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-02 07:50:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 191. [2018-12-02 07:50:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 283 transitions. [2018-12-02 07:50:18,243 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 283 transitions. Word has length 64 [2018-12-02 07:50:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:18,243 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 283 transitions. [2018-12-02 07:50:18,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 283 transitions. [2018-12-02 07:50:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 07:50:18,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:18,243 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] [2018-12-02 07:50:18,243 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:18,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:18,244 INFO L82 PathProgramCache]: Analyzing trace with hash 781376025, now seen corresponding path program 1 times [2018-12-02 07:50:18,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:18,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:18,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:18,282 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-02 07:50:18,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:18,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:18,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:18,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:18,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:18,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:18,283 INFO L87 Difference]: Start difference. First operand 191 states and 283 transitions. Second operand 4 states. [2018-12-02 07:50:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:18,430 INFO L93 Difference]: Finished difference Result 360 states and 541 transitions. [2018-12-02 07:50:18,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:18,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 07:50:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:18,431 INFO L225 Difference]: With dead ends: 360 [2018-12-02 07:50:18,431 INFO L226 Difference]: Without dead ends: 194 [2018-12-02 07:50:18,431 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-02 07:50:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-02 07:50:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-12-02 07:50:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 282 transitions. [2018-12-02 07:50:18,435 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 282 transitions. Word has length 65 [2018-12-02 07:50:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:18,436 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 282 transitions. [2018-12-02 07:50:18,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 282 transitions. [2018-12-02 07:50:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 07:50:18,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:18,436 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] [2018-12-02 07:50:18,437 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:18,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash -304224811, now seen corresponding path program 1 times [2018-12-02 07:50:18,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:18,476 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-02 07:50:18,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:18,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:18,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:18,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:18,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:18,477 INFO L87 Difference]: Start difference. First operand 191 states and 282 transitions. Second operand 4 states. [2018-12-02 07:50:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:18,640 INFO L93 Difference]: Finished difference Result 377 states and 561 transitions. [2018-12-02 07:50:18,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:18,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-02 07:50:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:18,642 INFO L225 Difference]: With dead ends: 377 [2018-12-02 07:50:18,642 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 07:50:18,642 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-02 07:50:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 07:50:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2018-12-02 07:50:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 281 transitions. [2018-12-02 07:50:18,648 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 281 transitions. Word has length 77 [2018-12-02 07:50:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:18,649 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 281 transitions. [2018-12-02 07:50:18,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2018-12-02 07:50:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 07:50:18,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:18,650 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] [2018-12-02 07:50:18,650 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:18,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:18,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2031678086, now seen corresponding path program 1 times [2018-12-02 07:50:18,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:18,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:18,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:18,686 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-02 07:50:18,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:18,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:18,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:18,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:18,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:18,687 INFO L87 Difference]: Start difference. First operand 191 states and 281 transitions. Second operand 4 states. [2018-12-02 07:50:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:18,866 INFO L93 Difference]: Finished difference Result 375 states and 557 transitions. [2018-12-02 07:50:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:18,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 07:50:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:18,867 INFO L225 Difference]: With dead ends: 375 [2018-12-02 07:50:18,867 INFO L226 Difference]: Without dead ends: 209 [2018-12-02 07:50:18,868 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-02 07:50:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-02 07:50:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 191. [2018-12-02 07:50:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2018-12-02 07:50:18,872 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 280 transitions. Word has length 78 [2018-12-02 07:50:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:18,872 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 280 transitions. [2018-12-02 07:50:18,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2018-12-02 07:50:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 07:50:18,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:18,872 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] [2018-12-02 07:50:18,873 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:18,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash 605260795, now seen corresponding path program 1 times [2018-12-02 07:50:18,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:18,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:18,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:18,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:18,901 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-02 07:50:18,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:18,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:18,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:18,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:18,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:18,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:18,901 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. Second operand 4 states. [2018-12-02 07:50:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:19,105 INFO L93 Difference]: Finished difference Result 374 states and 554 transitions. [2018-12-02 07:50:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:19,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 07:50:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:19,106 INFO L225 Difference]: With dead ends: 374 [2018-12-02 07:50:19,106 INFO L226 Difference]: Without dead ends: 208 [2018-12-02 07:50:19,107 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-02 07:50:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-02 07:50:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2018-12-02 07:50:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2018-12-02 07:50:19,114 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 78 [2018-12-02 07:50:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:19,114 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2018-12-02 07:50:19,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2018-12-02 07:50:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 07:50:19,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:19,115 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] [2018-12-02 07:50:19,116 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:19,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:19,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1307513170, now seen corresponding path program 1 times [2018-12-02 07:50:19,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:19,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:19,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:19,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:19,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:19,172 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-02 07:50:19,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:19,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:19,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:19,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:19,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:19,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:19,173 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand 4 states. [2018-12-02 07:50:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:19,345 INFO L93 Difference]: Finished difference Result 374 states and 552 transitions. [2018-12-02 07:50:19,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:19,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 07:50:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:19,346 INFO L225 Difference]: With dead ends: 374 [2018-12-02 07:50:19,347 INFO L226 Difference]: Without dead ends: 208 [2018-12-02 07:50:19,347 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-02 07:50:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-02 07:50:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2018-12-02 07:50:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 278 transitions. [2018-12-02 07:50:19,354 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 278 transitions. Word has length 79 [2018-12-02 07:50:19,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:19,354 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 278 transitions. [2018-12-02 07:50:19,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 278 transitions. [2018-12-02 07:50:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 07:50:19,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:19,355 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] [2018-12-02 07:50:19,355 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:19,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1447679223, now seen corresponding path program 1 times [2018-12-02 07:50:19,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:19,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:19,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:19,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:19,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:19,412 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-02 07:50:19,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:19,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:19,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:19,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:19,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:19,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:19,413 INFO L87 Difference]: Start difference. First operand 191 states and 278 transitions. Second operand 4 states. [2018-12-02 07:50:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:19,578 INFO L93 Difference]: Finished difference Result 374 states and 550 transitions. [2018-12-02 07:50:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:19,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 07:50:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:19,579 INFO L225 Difference]: With dead ends: 374 [2018-12-02 07:50:19,579 INFO L226 Difference]: Without dead ends: 208 [2018-12-02 07:50:19,579 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-02 07:50:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-02 07:50:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2018-12-02 07:50:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 277 transitions. [2018-12-02 07:50:19,583 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 277 transitions. Word has length 80 [2018-12-02 07:50:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:19,584 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 277 transitions. [2018-12-02 07:50:19,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 277 transitions. [2018-12-02 07:50:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 07:50:19,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:19,584 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] [2018-12-02 07:50:19,584 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:19,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:19,585 INFO L82 PathProgramCache]: Analyzing trace with hash -123909619, now seen corresponding path program 1 times [2018-12-02 07:50:19,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:19,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:19,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:19,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:19,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:19,612 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-02 07:50:19,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:19,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:19,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:19,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:19,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:19,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:19,613 INFO L87 Difference]: Start difference. First operand 191 states and 277 transitions. Second operand 4 states. [2018-12-02 07:50:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:19,768 INFO L93 Difference]: Finished difference Result 374 states and 548 transitions. [2018-12-02 07:50:19,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:19,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 07:50:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:19,769 INFO L225 Difference]: With dead ends: 374 [2018-12-02 07:50:19,769 INFO L226 Difference]: Without dead ends: 208 [2018-12-02 07:50:19,769 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-02 07:50:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-02 07:50:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2018-12-02 07:50:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2018-12-02 07:50:19,773 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 81 [2018-12-02 07:50:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:19,773 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2018-12-02 07:50:19,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2018-12-02 07:50:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 07:50:19,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:19,774 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] [2018-12-02 07:50:19,774 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:19,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1074674642, now seen corresponding path program 1 times [2018-12-02 07:50:19,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:19,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:19,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:19,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:19,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:19,810 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-02 07:50:19,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:19,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:19,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:19,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:19,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:19,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:19,811 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand 4 states. [2018-12-02 07:50:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:20,030 INFO L93 Difference]: Finished difference Result 364 states and 534 transitions. [2018-12-02 07:50:20,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:20,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 07:50:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:20,031 INFO L225 Difference]: With dead ends: 364 [2018-12-02 07:50:20,031 INFO L226 Difference]: Without dead ends: 198 [2018-12-02 07:50:20,032 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-02 07:50:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-02 07:50:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-12-02 07:50:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 07:50:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 275 transitions. [2018-12-02 07:50:20,038 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 275 transitions. Word has length 82 [2018-12-02 07:50:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:20,038 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 275 transitions. [2018-12-02 07:50:20,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 275 transitions. [2018-12-02 07:50:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 07:50:20,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:20,039 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] [2018-12-02 07:50:20,039 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:20,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1603097898, now seen corresponding path program 1 times [2018-12-02 07:50:20,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:20,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:20,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:20,087 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-02 07:50:20,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:20,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:20,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:20,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:20,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:20,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:20,088 INFO L87 Difference]: Start difference. First operand 191 states and 275 transitions. Second operand 4 states. [2018-12-02 07:50:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:20,344 INFO L93 Difference]: Finished difference Result 461 states and 680 transitions. [2018-12-02 07:50:20,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:20,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-02 07:50:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:20,346 INFO L225 Difference]: With dead ends: 461 [2018-12-02 07:50:20,346 INFO L226 Difference]: Without dead ends: 295 [2018-12-02 07:50:20,346 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-02 07:50:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-02 07:50:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 232. [2018-12-02 07:50:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 07:50:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2018-12-02 07:50:20,351 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 86 [2018-12-02 07:50:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:20,352 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2018-12-02 07:50:20,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2018-12-02 07:50:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 07:50:20,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:20,353 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] [2018-12-02 07:50:20,353 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:20,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:20,353 INFO L82 PathProgramCache]: Analyzing trace with hash -242269268, now seen corresponding path program 1 times [2018-12-02 07:50:20,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:20,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:20,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:20,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:20,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:20,396 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-02 07:50:20,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:20,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:20,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:20,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:20,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:20,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:20,397 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2018-12-02 07:50:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:20,597 INFO L93 Difference]: Finished difference Result 487 states and 740 transitions. [2018-12-02 07:50:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:20,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-02 07:50:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:20,598 INFO L225 Difference]: With dead ends: 487 [2018-12-02 07:50:20,598 INFO L226 Difference]: Without dead ends: 280 [2018-12-02 07:50:20,599 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-02 07:50:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-02 07:50:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-12-02 07:50:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-02 07:50:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2018-12-02 07:50:20,606 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 86 [2018-12-02 07:50:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:20,607 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2018-12-02 07:50:20,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2018-12-02 07:50:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 07:50:20,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:20,608 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:50:20,608 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:20,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1850075530, now seen corresponding path program 1 times [2018-12-02 07:50:20,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:20,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:20,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:20,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:20,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:20,663 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-02 07:50:20,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:20,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:20,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:20,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:20,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:20,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:20,664 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2018-12-02 07:50:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:20,888 INFO L93 Difference]: Finished difference Result 544 states and 827 transitions. [2018-12-02 07:50:20,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:20,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-02 07:50:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:20,890 INFO L225 Difference]: With dead ends: 544 [2018-12-02 07:50:20,890 INFO L226 Difference]: Without dead ends: 313 [2018-12-02 07:50:20,890 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-02 07:50:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-02 07:50:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2018-12-02 07:50:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2018-12-02 07:50:20,896 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 87 [2018-12-02 07:50:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:20,896 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2018-12-02 07:50:20,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2018-12-02 07:50:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:50:20,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:20,897 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] [2018-12-02 07:50:20,898 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:20,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:20,898 INFO L82 PathProgramCache]: Analyzing trace with hash -776561200, now seen corresponding path program 1 times [2018-12-02 07:50:20,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:20,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:20,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:20,944 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-02 07:50:20,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:20,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:20,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:20,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:20,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:20,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:20,945 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2018-12-02 07:50:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:21,193 INFO L93 Difference]: Finished difference Result 545 states and 827 transitions. [2018-12-02 07:50:21,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:21,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-02 07:50:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:21,195 INFO L225 Difference]: With dead ends: 545 [2018-12-02 07:50:21,195 INFO L226 Difference]: Without dead ends: 313 [2018-12-02 07:50:21,196 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-02 07:50:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-02 07:50:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2018-12-02 07:50:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2018-12-02 07:50:21,203 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 99 [2018-12-02 07:50:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:21,203 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2018-12-02 07:50:21,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2018-12-02 07:50:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 07:50:21,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:21,204 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] [2018-12-02 07:50:21,204 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:21,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash 761778830, now seen corresponding path program 1 times [2018-12-02 07:50:21,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:21,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:21,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:21,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:21,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:21,248 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-02 07:50:21,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:21,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:21,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:21,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:21,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:21,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:21,249 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2018-12-02 07:50:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:21,491 INFO L93 Difference]: Finished difference Result 513 states and 780 transitions. [2018-12-02 07:50:21,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:21,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-02 07:50:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:21,492 INFO L225 Difference]: With dead ends: 513 [2018-12-02 07:50:21,492 INFO L226 Difference]: Without dead ends: 281 [2018-12-02 07:50:21,493 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-02 07:50:21,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-02 07:50:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 257. [2018-12-02 07:50:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2018-12-02 07:50:21,501 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 99 [2018-12-02 07:50:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:21,501 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2018-12-02 07:50:21,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2018-12-02 07:50:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 07:50:21,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:21,502 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] [2018-12-02 07:50:21,503 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:21,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash 505763039, now seen corresponding path program 1 times [2018-12-02 07:50:21,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:21,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:21,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:21,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:21,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:21,559 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-02 07:50:21,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:21,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:21,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:21,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:21,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:21,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:21,560 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2018-12-02 07:50:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:21,777 INFO L93 Difference]: Finished difference Result 543 states and 821 transitions. [2018-12-02 07:50:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:21,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 07:50:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:21,778 INFO L225 Difference]: With dead ends: 543 [2018-12-02 07:50:21,778 INFO L226 Difference]: Without dead ends: 311 [2018-12-02 07:50:21,779 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-02 07:50:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-02 07:50:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 257. [2018-12-02 07:50:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2018-12-02 07:50:21,785 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 100 [2018-12-02 07:50:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:21,786 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2018-12-02 07:50:21,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2018-12-02 07:50:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 07:50:21,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:21,786 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] [2018-12-02 07:50:21,786 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:21,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1152265376, now seen corresponding path program 1 times [2018-12-02 07:50:21,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:21,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:21,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:21,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:21,826 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-02 07:50:21,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:21,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:21,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:21,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:21,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:21,827 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2018-12-02 07:50:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:22,037 INFO L93 Difference]: Finished difference Result 542 states and 818 transitions. [2018-12-02 07:50:22,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:22,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 07:50:22,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:22,038 INFO L225 Difference]: With dead ends: 542 [2018-12-02 07:50:22,038 INFO L226 Difference]: Without dead ends: 310 [2018-12-02 07:50:22,038 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-02 07:50:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-02 07:50:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2018-12-02 07:50:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2018-12-02 07:50:22,048 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 100 [2018-12-02 07:50:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:22,048 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2018-12-02 07:50:22,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2018-12-02 07:50:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 07:50:22,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:22,049 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] [2018-12-02 07:50:22,049 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:22,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash 949663713, now seen corresponding path program 1 times [2018-12-02 07:50:22,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:22,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:22,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:22,092 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-02 07:50:22,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:22,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:22,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:22,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:22,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:22,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:22,093 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2018-12-02 07:50:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:22,261 INFO L93 Difference]: Finished difference Result 511 states and 772 transitions. [2018-12-02 07:50:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:22,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 07:50:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:22,262 INFO L225 Difference]: With dead ends: 511 [2018-12-02 07:50:22,262 INFO L226 Difference]: Without dead ends: 279 [2018-12-02 07:50:22,263 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-02 07:50:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-02 07:50:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2018-12-02 07:50:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2018-12-02 07:50:22,273 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 100 [2018-12-02 07:50:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:22,273 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2018-12-02 07:50:22,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2018-12-02 07:50:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 07:50:22,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:22,274 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] [2018-12-02 07:50:22,274 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:22,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash -708364702, now seen corresponding path program 1 times [2018-12-02 07:50:22,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:22,323 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-02 07:50:22,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:22,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:22,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:22,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:22,324 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2018-12-02 07:50:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:22,474 INFO L93 Difference]: Finished difference Result 510 states and 769 transitions. [2018-12-02 07:50:22,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:22,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 07:50:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:22,475 INFO L225 Difference]: With dead ends: 510 [2018-12-02 07:50:22,475 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 07:50:22,475 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-02 07:50:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 07:50:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2018-12-02 07:50:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2018-12-02 07:50:22,483 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 100 [2018-12-02 07:50:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:22,483 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2018-12-02 07:50:22,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2018-12-02 07:50:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 07:50:22,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:22,484 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] [2018-12-02 07:50:22,484 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:22,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1636190579, now seen corresponding path program 1 times [2018-12-02 07:50:22,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:22,514 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-02 07:50:22,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:22,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:22,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:22,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:22,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:22,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:22,515 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2018-12-02 07:50:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:22,738 INFO L93 Difference]: Finished difference Result 542 states and 812 transitions. [2018-12-02 07:50:22,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:22,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 07:50:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:22,739 INFO L225 Difference]: With dead ends: 542 [2018-12-02 07:50:22,739 INFO L226 Difference]: Without dead ends: 310 [2018-12-02 07:50:22,740 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-02 07:50:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-02 07:50:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2018-12-02 07:50:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2018-12-02 07:50:22,746 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 101 [2018-12-02 07:50:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:22,746 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2018-12-02 07:50:22,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2018-12-02 07:50:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 07:50:22,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:22,747 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] [2018-12-02 07:50:22,747 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:22,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:22,748 INFO L82 PathProgramCache]: Analyzing trace with hash -760171573, now seen corresponding path program 1 times [2018-12-02 07:50:22,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:22,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:22,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:22,781 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-02 07:50:22,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:22,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:22,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:22,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:22,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:22,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:22,782 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2018-12-02 07:50:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:22,964 INFO L93 Difference]: Finished difference Result 510 states and 765 transitions. [2018-12-02 07:50:22,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:22,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 07:50:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:22,965 INFO L225 Difference]: With dead ends: 510 [2018-12-02 07:50:22,965 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 07:50:22,966 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-02 07:50:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 07:50:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2018-12-02 07:50:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2018-12-02 07:50:22,975 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 101 [2018-12-02 07:50:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:22,975 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2018-12-02 07:50:22,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2018-12-02 07:50:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 07:50:22,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:22,976 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] [2018-12-02 07:50:22,976 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:22,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:22,977 INFO L82 PathProgramCache]: Analyzing trace with hash 387176220, now seen corresponding path program 1 times [2018-12-02 07:50:22,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:22,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:22,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:23,019 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-02 07:50:23,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:23,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:23,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:23,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:23,020 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2018-12-02 07:50:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:23,231 INFO L93 Difference]: Finished difference Result 542 states and 808 transitions. [2018-12-02 07:50:23,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:23,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 07:50:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:23,232 INFO L225 Difference]: With dead ends: 542 [2018-12-02 07:50:23,232 INFO L226 Difference]: Without dead ends: 310 [2018-12-02 07:50:23,233 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-02 07:50:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-02 07:50:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2018-12-02 07:50:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2018-12-02 07:50:23,238 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 102 [2018-12-02 07:50:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:23,238 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2018-12-02 07:50:23,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2018-12-02 07:50:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 07:50:23,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:23,239 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] [2018-12-02 07:50:23,239 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:23,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1773961630, now seen corresponding path program 1 times [2018-12-02 07:50:23,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:23,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:23,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:23,273 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-02 07:50:23,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:23,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:23,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:23,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:23,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:23,274 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 4 states. [2018-12-02 07:50:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:23,422 INFO L93 Difference]: Finished difference Result 510 states and 761 transitions. [2018-12-02 07:50:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:23,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 07:50:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:23,423 INFO L225 Difference]: With dead ends: 510 [2018-12-02 07:50:23,423 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 07:50:23,423 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-02 07:50:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 07:50:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2018-12-02 07:50:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 380 transitions. [2018-12-02 07:50:23,429 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 380 transitions. Word has length 102 [2018-12-02 07:50:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:23,429 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 380 transitions. [2018-12-02 07:50:23,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 380 transitions. [2018-12-02 07:50:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 07:50:23,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:23,430 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] [2018-12-02 07:50:23,430 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:23,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1360235656, now seen corresponding path program 1 times [2018-12-02 07:50:23,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:23,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:23,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:23,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:23,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:23,459 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-02 07:50:23,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:23,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:23,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:23,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:23,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:23,460 INFO L87 Difference]: Start difference. First operand 257 states and 380 transitions. Second operand 4 states. [2018-12-02 07:50:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:23,666 INFO L93 Difference]: Finished difference Result 542 states and 804 transitions. [2018-12-02 07:50:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:23,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 07:50:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:23,667 INFO L225 Difference]: With dead ends: 542 [2018-12-02 07:50:23,667 INFO L226 Difference]: Without dead ends: 310 [2018-12-02 07:50:23,667 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-02 07:50:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-02 07:50:23,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2018-12-02 07:50:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 379 transitions. [2018-12-02 07:50:23,674 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 379 transitions. Word has length 103 [2018-12-02 07:50:23,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:23,674 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 379 transitions. [2018-12-02 07:50:23,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2018-12-02 07:50:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 07:50:23,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:23,675 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] [2018-12-02 07:50:23,675 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:23,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1400910406, now seen corresponding path program 1 times [2018-12-02 07:50:23,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:23,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:23,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:23,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:23,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:23,704 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-02 07:50:23,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:23,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:23,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:23,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:23,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:23,705 INFO L87 Difference]: Start difference. First operand 257 states and 379 transitions. Second operand 4 states. [2018-12-02 07:50:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:23,863 INFO L93 Difference]: Finished difference Result 510 states and 757 transitions. [2018-12-02 07:50:23,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:23,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 07:50:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:23,864 INFO L225 Difference]: With dead ends: 510 [2018-12-02 07:50:23,864 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 07:50:23,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:50:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 07:50:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2018-12-02 07:50:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 378 transitions. [2018-12-02 07:50:23,871 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 378 transitions. Word has length 103 [2018-12-02 07:50:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:23,871 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 378 transitions. [2018-12-02 07:50:23,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2018-12-02 07:50:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 07:50:23,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:23,872 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] [2018-12-02 07:50:23,872 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:23,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:23,872 INFO L82 PathProgramCache]: Analyzing trace with hash -161462089, now seen corresponding path program 1 times [2018-12-02 07:50:23,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:23,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:23,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:23,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:23,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:23,900 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-02 07:50:23,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:23,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:23,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:23,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:23,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:23,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:23,902 INFO L87 Difference]: Start difference. First operand 257 states and 378 transitions. Second operand 4 states. [2018-12-02 07:50:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:24,083 INFO L93 Difference]: Finished difference Result 532 states and 788 transitions. [2018-12-02 07:50:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:24,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-02 07:50:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:24,084 INFO L225 Difference]: With dead ends: 532 [2018-12-02 07:50:24,085 INFO L226 Difference]: Without dead ends: 300 [2018-12-02 07:50:24,085 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-02 07:50:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-02 07:50:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2018-12-02 07:50:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 377 transitions. [2018-12-02 07:50:24,092 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 377 transitions. Word has length 104 [2018-12-02 07:50:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:24,093 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 377 transitions. [2018-12-02 07:50:24,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 377 transitions. [2018-12-02 07:50:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 07:50:24,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:24,093 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] [2018-12-02 07:50:24,094 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:24,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1099455161, now seen corresponding path program 1 times [2018-12-02 07:50:24,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:24,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:24,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:24,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:24,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:24,123 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-02 07:50:24,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:24,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:24,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:24,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:24,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:24,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:24,124 INFO L87 Difference]: Start difference. First operand 257 states and 377 transitions. Second operand 4 states. [2018-12-02 07:50:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:24,266 INFO L93 Difference]: Finished difference Result 500 states and 741 transitions. [2018-12-02 07:50:24,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:24,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-02 07:50:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:24,268 INFO L225 Difference]: With dead ends: 500 [2018-12-02 07:50:24,268 INFO L226 Difference]: Without dead ends: 268 [2018-12-02 07:50:24,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:50:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-02 07:50:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2018-12-02 07:50:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 376 transitions. [2018-12-02 07:50:24,276 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 376 transitions. Word has length 104 [2018-12-02 07:50:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:24,276 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 376 transitions. [2018-12-02 07:50:24,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 376 transitions. [2018-12-02 07:50:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 07:50:24,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:24,276 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] [2018-12-02 07:50:24,277 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:24,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1423943715, now seen corresponding path program 1 times [2018-12-02 07:50:24,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:24,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:24,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:24,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:24,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:24,312 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-02 07:50:24,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:24,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:24,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:24,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:24,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:24,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:24,314 INFO L87 Difference]: Start difference. First operand 257 states and 376 transitions. Second operand 4 states. [2018-12-02 07:50:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:24,508 INFO L93 Difference]: Finished difference Result 532 states and 784 transitions. [2018-12-02 07:50:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:24,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-02 07:50:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:24,509 INFO L225 Difference]: With dead ends: 532 [2018-12-02 07:50:24,509 INFO L226 Difference]: Without dead ends: 300 [2018-12-02 07:50:24,509 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-02 07:50:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-02 07:50:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2018-12-02 07:50:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-02 07:50:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 375 transitions. [2018-12-02 07:50:24,516 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 375 transitions. Word has length 108 [2018-12-02 07:50:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:24,516 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 375 transitions. [2018-12-02 07:50:24,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 375 transitions. [2018-12-02 07:50:24,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 07:50:24,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:24,516 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] [2018-12-02 07:50:24,516 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:24,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:24,517 INFO L82 PathProgramCache]: Analyzing trace with hash -909448923, now seen corresponding path program 1 times [2018-12-02 07:50:24,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:24,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:24,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:24,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:24,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:24,551 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-02 07:50:24,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:24,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:24,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:24,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:24,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:24,551 INFO L87 Difference]: Start difference. First operand 257 states and 375 transitions. Second operand 4 states. [2018-12-02 07:50:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:24,755 INFO L93 Difference]: Finished difference Result 541 states and 801 transitions. [2018-12-02 07:50:24,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:24,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-02 07:50:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:24,756 INFO L225 Difference]: With dead ends: 541 [2018-12-02 07:50:24,756 INFO L226 Difference]: Without dead ends: 309 [2018-12-02 07:50:24,757 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-02 07:50:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-02 07:50:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2018-12-02 07:50:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 420 transitions. [2018-12-02 07:50:24,768 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 420 transitions. Word has length 108 [2018-12-02 07:50:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:24,768 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 420 transitions. [2018-12-02 07:50:24,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 420 transitions. [2018-12-02 07:50:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 07:50:24,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:24,769 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] [2018-12-02 07:50:24,769 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:24,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:24,769 INFO L82 PathProgramCache]: Analyzing trace with hash -336160653, now seen corresponding path program 1 times [2018-12-02 07:50:24,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:24,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:24,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:24,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:24,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:24,810 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-02 07:50:24,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:24,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:24,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:24,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:24,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:24,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:24,811 INFO L87 Difference]: Start difference. First operand 283 states and 420 transitions. Second operand 4 states. [2018-12-02 07:50:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:25,009 INFO L93 Difference]: Finished difference Result 584 states and 872 transitions. [2018-12-02 07:50:25,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:25,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-02 07:50:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:25,010 INFO L225 Difference]: With dead ends: 584 [2018-12-02 07:50:25,010 INFO L226 Difference]: Without dead ends: 326 [2018-12-02 07:50:25,010 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-02 07:50:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-02 07:50:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 283. [2018-12-02 07:50:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 419 transitions. [2018-12-02 07:50:25,019 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 419 transitions. Word has length 111 [2018-12-02 07:50:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:25,019 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 419 transitions. [2018-12-02 07:50:25,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 419 transitions. [2018-12-02 07:50:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 07:50:25,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:25,020 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] [2018-12-02 07:50:25,020 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:25,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:25,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1613279934, now seen corresponding path program 1 times [2018-12-02 07:50:25,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:25,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:25,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:25,053 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-02 07:50:25,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:25,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:25,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:25,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:25,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:25,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:25,053 INFO L87 Difference]: Start difference. First operand 283 states and 419 transitions. Second operand 4 states. [2018-12-02 07:50:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:25,272 INFO L93 Difference]: Finished difference Result 576 states and 857 transitions. [2018-12-02 07:50:25,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:25,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-02 07:50:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:25,274 INFO L225 Difference]: With dead ends: 576 [2018-12-02 07:50:25,275 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 07:50:25,275 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-02 07:50:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 07:50:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2018-12-02 07:50:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 418 transitions. [2018-12-02 07:50:25,290 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 418 transitions. Word has length 112 [2018-12-02 07:50:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:25,290 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 418 transitions. [2018-12-02 07:50:25,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 418 transitions. [2018-12-02 07:50:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 07:50:25,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:25,291 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] [2018-12-02 07:50:25,292 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:25,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash -983730547, now seen corresponding path program 1 times [2018-12-02 07:50:25,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:25,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:25,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:25,332 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-02 07:50:25,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:25,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:25,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:25,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:25,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:25,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:25,333 INFO L87 Difference]: Start difference. First operand 283 states and 418 transitions. Second operand 4 states. [2018-12-02 07:50:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:25,526 INFO L93 Difference]: Finished difference Result 576 states and 855 transitions. [2018-12-02 07:50:25,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:25,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-02 07:50:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:25,527 INFO L225 Difference]: With dead ends: 576 [2018-12-02 07:50:25,527 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 07:50:25,528 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-02 07:50:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 07:50:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2018-12-02 07:50:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2018-12-02 07:50:25,537 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 113 [2018-12-02 07:50:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:25,538 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2018-12-02 07:50:25,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2018-12-02 07:50:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 07:50:25,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:25,538 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] [2018-12-02 07:50:25,539 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:25,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:25,539 INFO L82 PathProgramCache]: Analyzing trace with hash -305522056, now seen corresponding path program 1 times [2018-12-02 07:50:25,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:25,577 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-02 07:50:25,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:25,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:25,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:25,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:25,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:25,578 INFO L87 Difference]: Start difference. First operand 283 states and 417 transitions. Second operand 4 states. [2018-12-02 07:50:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:25,757 INFO L93 Difference]: Finished difference Result 576 states and 853 transitions. [2018-12-02 07:50:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:25,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-02 07:50:25,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:25,758 INFO L225 Difference]: With dead ends: 576 [2018-12-02 07:50:25,758 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 07:50:25,759 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-02 07:50:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 07:50:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2018-12-02 07:50:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2018-12-02 07:50:25,773 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 114 [2018-12-02 07:50:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:25,774 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2018-12-02 07:50:25,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2018-12-02 07:50:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 07:50:25,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:25,774 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] [2018-12-02 07:50:25,774 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:25,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1989852924, now seen corresponding path program 1 times [2018-12-02 07:50:25,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:25,806 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-02 07:50:25,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:25,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:25,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:25,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:25,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:25,807 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand 4 states. [2018-12-02 07:50:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:25,985 INFO L93 Difference]: Finished difference Result 574 states and 849 transitions. [2018-12-02 07:50:25,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:25,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-02 07:50:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:25,986 INFO L225 Difference]: With dead ends: 574 [2018-12-02 07:50:25,986 INFO L226 Difference]: Without dead ends: 316 [2018-12-02 07:50:25,987 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-02 07:50:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-02 07:50:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2018-12-02 07:50:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 415 transitions. [2018-12-02 07:50:25,995 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 415 transitions. Word has length 114 [2018-12-02 07:50:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:25,995 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 415 transitions. [2018-12-02 07:50:25,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 415 transitions. [2018-12-02 07:50:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 07:50:25,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:25,995 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] [2018-12-02 07:50:25,995 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:25,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:25,996 INFO L82 PathProgramCache]: Analyzing trace with hash 568172779, now seen corresponding path program 1 times [2018-12-02 07:50:25,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:25,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:25,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:25,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:26,029 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-02 07:50:26,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:26,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:26,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:26,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:26,030 INFO L87 Difference]: Start difference. First operand 283 states and 415 transitions. Second operand 4 states. [2018-12-02 07:50:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:26,199 INFO L93 Difference]: Finished difference Result 571 states and 843 transitions. [2018-12-02 07:50:26,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:26,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 07:50:26,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:26,200 INFO L225 Difference]: With dead ends: 571 [2018-12-02 07:50:26,201 INFO L226 Difference]: Without dead ends: 313 [2018-12-02 07:50:26,201 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-02 07:50:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-02 07:50:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2018-12-02 07:50:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 414 transitions. [2018-12-02 07:50:26,209 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 414 transitions. Word has length 115 [2018-12-02 07:50:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:26,210 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 414 transitions. [2018-12-02 07:50:26,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 414 transitions. [2018-12-02 07:50:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 07:50:26,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:26,210 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] [2018-12-02 07:50:26,211 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:26,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash 926271145, now seen corresponding path program 1 times [2018-12-02 07:50:26,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:26,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:26,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:26,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:26,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:26,245 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-02 07:50:26,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:26,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:26,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:26,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:26,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:26,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:26,246 INFO L87 Difference]: Start difference. First operand 283 states and 414 transitions. Second operand 4 states. [2018-12-02 07:50:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:26,689 INFO L93 Difference]: Finished difference Result 569 states and 838 transitions. [2018-12-02 07:50:26,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:26,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 07:50:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:26,693 INFO L225 Difference]: With dead ends: 569 [2018-12-02 07:50:26,693 INFO L226 Difference]: Without dead ends: 311 [2018-12-02 07:50:26,694 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-02 07:50:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-02 07:50:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 283. [2018-12-02 07:50:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2018-12-02 07:50:26,718 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 115 [2018-12-02 07:50:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:26,719 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2018-12-02 07:50:26,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2018-12-02 07:50:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 07:50:26,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:26,720 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] [2018-12-02 07:50:26,720 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:26,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1835524813, now seen corresponding path program 1 times [2018-12-02 07:50:26,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:26,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:26,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:26,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:26,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:26,770 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-02 07:50:26,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:26,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:26,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:26,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:26,771 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand 4 states. [2018-12-02 07:50:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:26,940 INFO L93 Difference]: Finished difference Result 569 states and 836 transitions. [2018-12-02 07:50:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:26,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-02 07:50:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:26,941 INFO L225 Difference]: With dead ends: 569 [2018-12-02 07:50:26,941 INFO L226 Difference]: Without dead ends: 311 [2018-12-02 07:50:26,942 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-02 07:50:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-02 07:50:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 283. [2018-12-02 07:50:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 412 transitions. [2018-12-02 07:50:26,950 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 412 transitions. Word has length 117 [2018-12-02 07:50:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:26,950 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 412 transitions. [2018-12-02 07:50:26,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 412 transitions. [2018-12-02 07:50:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-02 07:50:26,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:26,951 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] [2018-12-02 07:50:26,951 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:26,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:26,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1824561631, now seen corresponding path program 1 times [2018-12-02 07:50:26,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:26,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:26,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:26,983 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-02 07:50:26,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:26,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:26,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:26,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:26,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:26,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:26,984 INFO L87 Difference]: Start difference. First operand 283 states and 412 transitions. Second operand 4 states. [2018-12-02 07:50:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:27,151 INFO L93 Difference]: Finished difference Result 565 states and 829 transitions. [2018-12-02 07:50:27,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:27,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-12-02 07:50:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:27,152 INFO L225 Difference]: With dead ends: 565 [2018-12-02 07:50:27,152 INFO L226 Difference]: Without dead ends: 307 [2018-12-02 07:50:27,153 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-02 07:50:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-02 07:50:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2018-12-02 07:50:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 411 transitions. [2018-12-02 07:50:27,161 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 411 transitions. Word has length 118 [2018-12-02 07:50:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:27,161 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 411 transitions. [2018-12-02 07:50:27,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 411 transitions. [2018-12-02 07:50:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-02 07:50:27,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:27,162 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] [2018-12-02 07:50:27,162 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:27,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:27,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1368024590, now seen corresponding path program 1 times [2018-12-02 07:50:27,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:27,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:27,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:27,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:27,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:27,203 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-02 07:50:27,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:27,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:27,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:27,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:27,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:27,204 INFO L87 Difference]: Start difference. First operand 283 states and 411 transitions. Second operand 4 states. [2018-12-02 07:50:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:27,378 INFO L93 Difference]: Finished difference Result 565 states and 827 transitions. [2018-12-02 07:50:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:27,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-12-02 07:50:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:27,379 INFO L225 Difference]: With dead ends: 565 [2018-12-02 07:50:27,380 INFO L226 Difference]: Without dead ends: 307 [2018-12-02 07:50:27,380 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-02 07:50:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-02 07:50:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2018-12-02 07:50:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 410 transitions. [2018-12-02 07:50:27,388 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 410 transitions. Word has length 118 [2018-12-02 07:50:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:27,388 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 410 transitions. [2018-12-02 07:50:27,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 410 transitions. [2018-12-02 07:50:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 07:50:27,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:27,389 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] [2018-12-02 07:50:27,389 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:27,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:27,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1236988802, now seen corresponding path program 1 times [2018-12-02 07:50:27,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:27,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:27,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:27,438 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-02 07:50:27,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:27,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:27,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:27,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:27,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:27,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:27,439 INFO L87 Difference]: Start difference. First operand 283 states and 410 transitions. Second operand 4 states. [2018-12-02 07:50:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:27,596 INFO L93 Difference]: Finished difference Result 563 states and 823 transitions. [2018-12-02 07:50:27,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:27,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-02 07:50:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:27,598 INFO L225 Difference]: With dead ends: 563 [2018-12-02 07:50:27,598 INFO L226 Difference]: Without dead ends: 305 [2018-12-02 07:50:27,599 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-02 07:50:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-02 07:50:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2018-12-02 07:50:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 409 transitions. [2018-12-02 07:50:27,607 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 409 transitions. Word has length 119 [2018-12-02 07:50:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:27,607 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 409 transitions. [2018-12-02 07:50:27,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 409 transitions. [2018-12-02 07:50:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 07:50:27,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:27,608 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] [2018-12-02 07:50:27,608 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:27,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:27,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2076005651, now seen corresponding path program 1 times [2018-12-02 07:50:27,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:27,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:27,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:27,645 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-02 07:50:27,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:27,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:27,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:27,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:27,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:27,646 INFO L87 Difference]: Start difference. First operand 283 states and 409 transitions. Second operand 4 states. [2018-12-02 07:50:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:27,807 INFO L93 Difference]: Finished difference Result 563 states and 821 transitions. [2018-12-02 07:50:27,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:27,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-02 07:50:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:27,808 INFO L225 Difference]: With dead ends: 563 [2018-12-02 07:50:27,808 INFO L226 Difference]: Without dead ends: 305 [2018-12-02 07:50:27,809 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-02 07:50:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-02 07:50:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2018-12-02 07:50:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 408 transitions. [2018-12-02 07:50:27,817 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 408 transitions. Word has length 120 [2018-12-02 07:50:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:27,818 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 408 transitions. [2018-12-02 07:50:27,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 408 transitions. [2018-12-02 07:50:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 07:50:27,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 07:50:27,818 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:27,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:27,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1219900889, now seen corresponding path program 1 times [2018-12-02 07:50:27,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:27,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:27,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:27,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:27,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:27,855 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-02 07:50:27,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:27,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:27,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:27,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:27,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:27,856 INFO L87 Difference]: Start difference. First operand 283 states and 408 transitions. Second operand 4 states. [2018-12-02 07:50:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:28,016 INFO L93 Difference]: Finished difference Result 561 states and 817 transitions. [2018-12-02 07:50:28,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:28,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-02 07:50:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:28,018 INFO L225 Difference]: With dead ends: 561 [2018-12-02 07:50:28,018 INFO L226 Difference]: Without dead ends: 303 [2018-12-02 07:50:28,018 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-02 07:50:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-02 07:50:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 283. [2018-12-02 07:50:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-02 07:50:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2018-12-02 07:50:28,028 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 121 [2018-12-02 07:50:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:28,028 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2018-12-02 07:50:28,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2018-12-02 07:50:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 07:50:28,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:28,029 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] [2018-12-02 07:50:28,029 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:28,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:28,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2116773451, now seen corresponding path program 1 times [2018-12-02 07:50:28,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:28,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:28,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:28,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:28,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:28,062 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-02 07:50:28,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:28,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:28,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:28,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:28,063 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand 4 states. [2018-12-02 07:50:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:28,255 INFO L93 Difference]: Finished difference Result 612 states and 896 transitions. [2018-12-02 07:50:28,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:28,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-02 07:50:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:28,257 INFO L225 Difference]: With dead ends: 612 [2018-12-02 07:50:28,257 INFO L226 Difference]: Without dead ends: 354 [2018-12-02 07:50:28,257 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-02 07:50:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-02 07:50:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2018-12-02 07:50:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-02 07:50:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 464 transitions. [2018-12-02 07:50:28,266 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 464 transitions. Word has length 121 [2018-12-02 07:50:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:28,266 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 464 transitions. [2018-12-02 07:50:28,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 464 transitions. [2018-12-02 07:50:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-02 07:50:28,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:28,267 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] [2018-12-02 07:50:28,267 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:28,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:28,267 INFO L82 PathProgramCache]: Analyzing trace with hash 250827803, now seen corresponding path program 1 times [2018-12-02 07:50:28,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:28,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:28,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:28,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:28,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:28,299 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-02 07:50:28,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:28,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:28,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:28,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:28,299 INFO L87 Difference]: Start difference. First operand 315 states and 464 transitions. Second operand 4 states. [2018-12-02 07:50:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:28,526 INFO L93 Difference]: Finished difference Result 707 states and 1056 transitions. [2018-12-02 07:50:28,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:28,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-02 07:50:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:28,527 INFO L225 Difference]: With dead ends: 707 [2018-12-02 07:50:28,527 INFO L226 Difference]: Without dead ends: 417 [2018-12-02 07:50:28,528 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-02 07:50:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-02 07:50:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 354. [2018-12-02 07:50:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-02 07:50:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 535 transitions. [2018-12-02 07:50:28,545 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 535 transitions. Word has length 122 [2018-12-02 07:50:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:28,545 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 535 transitions. [2018-12-02 07:50:28,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 535 transitions. [2018-12-02 07:50:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 07:50:28,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:28,546 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] [2018-12-02 07:50:28,546 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:28,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1089974990, now seen corresponding path program 1 times [2018-12-02 07:50:28,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:28,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:28,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:28,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:28,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:28,583 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-02 07:50:28,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:28,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:28,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:28,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:28,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:28,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:28,584 INFO L87 Difference]: Start difference. First operand 354 states and 535 transitions. Second operand 4 states. [2018-12-02 07:50:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:28,752 INFO L93 Difference]: Finished difference Result 709 states and 1075 transitions. [2018-12-02 07:50:28,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:28,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-02 07:50:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:28,753 INFO L225 Difference]: With dead ends: 709 [2018-12-02 07:50:28,753 INFO L226 Difference]: Without dead ends: 380 [2018-12-02 07:50:28,753 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-02 07:50:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-02 07:50:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 354. [2018-12-02 07:50:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-02 07:50:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 534 transitions. [2018-12-02 07:50:28,763 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 534 transitions. Word has length 123 [2018-12-02 07:50:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:28,764 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 534 transitions. [2018-12-02 07:50:28,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 534 transitions. [2018-12-02 07:50:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 07:50:28,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:28,764 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] [2018-12-02 07:50:28,764 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:28,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash -820775515, now seen corresponding path program 1 times [2018-12-02 07:50:28,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:28,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:28,795 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-02 07:50:28,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:28,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:28,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:28,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:28,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:28,796 INFO L87 Difference]: Start difference. First operand 354 states and 534 transitions. Second operand 4 states. [2018-12-02 07:50:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:29,028 INFO L93 Difference]: Finished difference Result 740 states and 1117 transitions. [2018-12-02 07:50:29,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:29,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-02 07:50:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:29,029 INFO L225 Difference]: With dead ends: 740 [2018-12-02 07:50:29,029 INFO L226 Difference]: Without dead ends: 411 [2018-12-02 07:50:29,029 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-02 07:50:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-02 07:50:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 353. [2018-12-02 07:50:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-02 07:50:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 533 transitions. [2018-12-02 07:50:29,041 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 533 transitions. Word has length 123 [2018-12-02 07:50:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:29,041 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 533 transitions. [2018-12-02 07:50:29,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 533 transitions. [2018-12-02 07:50:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 07:50:29,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:29,042 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] [2018-12-02 07:50:29,042 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:29,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:29,042 INFO L82 PathProgramCache]: Analyzing trace with hash 139990295, now seen corresponding path program 1 times [2018-12-02 07:50:29,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:29,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:29,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:29,077 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-02 07:50:29,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:29,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:29,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:29,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:29,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:29,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:29,078 INFO L87 Difference]: Start difference. First operand 353 states and 533 transitions. Second operand 4 states. [2018-12-02 07:50:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:29,241 INFO L93 Difference]: Finished difference Result 707 states and 1071 transitions. [2018-12-02 07:50:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:29,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-02 07:50:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:29,242 INFO L225 Difference]: With dead ends: 707 [2018-12-02 07:50:29,242 INFO L226 Difference]: Without dead ends: 379 [2018-12-02 07:50:29,243 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-02 07:50:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-12-02 07:50:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2018-12-02 07:50:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-02 07:50:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 532 transitions. [2018-12-02 07:50:29,255 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 532 transitions. Word has length 124 [2018-12-02 07:50:29,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:29,255 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 532 transitions. [2018-12-02 07:50:29,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 532 transitions. [2018-12-02 07:50:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 07:50:29,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:29,256 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] [2018-12-02 07:50:29,256 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:29,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:29,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2007560723, now seen corresponding path program 1 times [2018-12-02 07:50:29,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:29,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:29,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:29,290 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-02 07:50:29,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:29,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:29,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:29,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:29,291 INFO L87 Difference]: Start difference. First operand 353 states and 532 transitions. Second operand 4 states. [2018-12-02 07:50:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:29,455 INFO L93 Difference]: Finished difference Result 707 states and 1069 transitions. [2018-12-02 07:50:29,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:29,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-02 07:50:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:29,457 INFO L225 Difference]: With dead ends: 707 [2018-12-02 07:50:29,457 INFO L226 Difference]: Without dead ends: 379 [2018-12-02 07:50:29,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:50:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-12-02 07:50:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2018-12-02 07:50:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-02 07:50:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 531 transitions. [2018-12-02 07:50:29,468 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 531 transitions. Word has length 125 [2018-12-02 07:50:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:29,468 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 531 transitions. [2018-12-02 07:50:29,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 531 transitions. [2018-12-02 07:50:29,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 07:50:29,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:29,468 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] [2018-12-02 07:50:29,469 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:29,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:29,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1483934734, now seen corresponding path program 1 times [2018-12-02 07:50:29,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:29,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:29,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:29,503 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-02 07:50:29,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:29,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:29,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:29,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:29,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:29,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:29,504 INFO L87 Difference]: Start difference. First operand 353 states and 531 transitions. Second operand 4 states. [2018-12-02 07:50:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:29,663 INFO L93 Difference]: Finished difference Result 697 states and 1055 transitions. [2018-12-02 07:50:29,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:29,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-02 07:50:29,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:29,664 INFO L225 Difference]: With dead ends: 697 [2018-12-02 07:50:29,664 INFO L226 Difference]: Without dead ends: 369 [2018-12-02 07:50:29,665 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-02 07:50:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-02 07:50:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2018-12-02 07:50:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-02 07:50:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2018-12-02 07:50:29,676 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 126 [2018-12-02 07:50:29,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:29,676 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2018-12-02 07:50:29,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2018-12-02 07:50:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 07:50:29,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:29,676 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] [2018-12-02 07:50:29,676 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:29,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:29,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1666532328, now seen corresponding path program 1 times [2018-12-02 07:50:29,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:29,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:29,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:29,717 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-02 07:50:29,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:29,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:29,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:29,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:29,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:29,718 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand 4 states. [2018-12-02 07:50:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:29,963 INFO L93 Difference]: Finished difference Result 783 states and 1188 transitions. [2018-12-02 07:50:29,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:29,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-02 07:50:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:29,964 INFO L225 Difference]: With dead ends: 783 [2018-12-02 07:50:29,965 INFO L226 Difference]: Without dead ends: 455 [2018-12-02 07:50:29,965 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-02 07:50:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-02 07:50:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 392. [2018-12-02 07:50:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-02 07:50:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 601 transitions. [2018-12-02 07:50:29,983 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 601 transitions. Word has length 127 [2018-12-02 07:50:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:29,983 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 601 transitions. [2018-12-02 07:50:29,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 601 transitions. [2018-12-02 07:50:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 07:50:29,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:29,984 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] [2018-12-02 07:50:29,984 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:29,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:29,984 INFO L82 PathProgramCache]: Analyzing trace with hash 116391800, now seen corresponding path program 1 times [2018-12-02 07:50:29,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:29,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:29,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:29,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:30,015 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-02 07:50:30,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:30,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:30,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:30,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:30,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:30,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:30,015 INFO L87 Difference]: Start difference. First operand 392 states and 601 transitions. Second operand 4 states. [2018-12-02 07:50:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:30,254 INFO L93 Difference]: Finished difference Result 816 states and 1251 transitions. [2018-12-02 07:50:30,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:30,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-02 07:50:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:30,255 INFO L225 Difference]: With dead ends: 816 [2018-12-02 07:50:30,256 INFO L226 Difference]: Without dead ends: 449 [2018-12-02 07:50:30,256 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-02 07:50:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-02 07:50:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 353. [2018-12-02 07:50:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-02 07:50:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2018-12-02 07:50:30,268 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 128 [2018-12-02 07:50:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:30,268 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2018-12-02 07:50:30,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2018-12-02 07:50:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 07:50:30,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:30,269 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-02 07:50:30,269 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:30,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash 176061736, now seen corresponding path program 1 times [2018-12-02 07:50:30,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:30,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:30,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:30,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:30,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:30,311 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-02 07:50:30,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:30,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:30,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:30,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:30,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:30,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:30,312 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand 4 states. [2018-12-02 07:50:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:30,473 INFO L93 Difference]: Finished difference Result 696 states and 1052 transitions. [2018-12-02 07:50:30,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:30,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-02 07:50:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:30,474 INFO L225 Difference]: With dead ends: 696 [2018-12-02 07:50:30,474 INFO L226 Difference]: Without dead ends: 368 [2018-12-02 07:50:30,475 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-02 07:50:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-12-02 07:50:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2018-12-02 07:50:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-02 07:50:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 533 transitions. [2018-12-02 07:50:30,487 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 533 transitions. Word has length 129 [2018-12-02 07:50:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:30,487 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 533 transitions. [2018-12-02 07:50:30,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 533 transitions. [2018-12-02 07:50:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-02 07:50:30,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:30,487 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] [2018-12-02 07:50:30,487 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:30,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash -25859422, now seen corresponding path program 1 times [2018-12-02 07:50:30,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:30,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:30,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:30,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:30,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:30,518 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-02 07:50:30,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:30,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:30,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:30,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:30,518 INFO L87 Difference]: Start difference. First operand 356 states and 533 transitions. Second operand 4 states. [2018-12-02 07:50:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:30,671 INFO L93 Difference]: Finished difference Result 703 states and 1059 transitions. [2018-12-02 07:50:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:30,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-12-02 07:50:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:30,672 INFO L225 Difference]: With dead ends: 703 [2018-12-02 07:50:30,672 INFO L226 Difference]: Without dead ends: 372 [2018-12-02 07:50:30,672 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-02 07:50:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-02 07:50:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 356. [2018-12-02 07:50:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-02 07:50:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 532 transitions. [2018-12-02 07:50:30,684 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 532 transitions. Word has length 136 [2018-12-02 07:50:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:30,684 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 532 transitions. [2018-12-02 07:50:30,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 532 transitions. [2018-12-02 07:50:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-02 07:50:30,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:30,685 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] [2018-12-02 07:50:30,685 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:30,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:30,685 INFO L82 PathProgramCache]: Analyzing trace with hash 739391475, now seen corresponding path program 1 times [2018-12-02 07:50:30,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:30,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:30,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:30,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:30,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:30,718 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-02 07:50:30,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:30,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:30,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:30,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:30,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:30,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:30,719 INFO L87 Difference]: Start difference. First operand 356 states and 532 transitions. Second operand 4 states. [2018-12-02 07:50:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:30,915 INFO L93 Difference]: Finished difference Result 749 states and 1132 transitions. [2018-12-02 07:50:30,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:30,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-12-02 07:50:30,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:30,916 INFO L225 Difference]: With dead ends: 749 [2018-12-02 07:50:30,916 INFO L226 Difference]: Without dead ends: 418 [2018-12-02 07:50:30,917 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-02 07:50:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-12-02 07:50:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2018-12-02 07:50:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-02 07:50:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 581 transitions. [2018-12-02 07:50:30,929 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 581 transitions. Word has length 136 [2018-12-02 07:50:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:30,929 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 581 transitions. [2018-12-02 07:50:30,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 581 transitions. [2018-12-02 07:50:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-02 07:50:30,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:30,930 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] [2018-12-02 07:50:30,930 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:30,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1373718557, now seen corresponding path program 1 times [2018-12-02 07:50:30,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:30,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:30,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:30,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:30,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:30,959 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-02 07:50:30,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:30,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:30,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:30,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:30,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:30,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:30,960 INFO L87 Difference]: Start difference. First operand 384 states and 581 transitions. Second operand 4 states. [2018-12-02 07:50:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:31,114 INFO L93 Difference]: Finished difference Result 757 states and 1153 transitions. [2018-12-02 07:50:31,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:31,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-02 07:50:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:31,115 INFO L225 Difference]: With dead ends: 757 [2018-12-02 07:50:31,115 INFO L226 Difference]: Without dead ends: 398 [2018-12-02 07:50:31,115 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-02 07:50:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-12-02 07:50:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2018-12-02 07:50:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-02 07:50:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 580 transitions. [2018-12-02 07:50:31,131 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 580 transitions. Word has length 137 [2018-12-02 07:50:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:31,131 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 580 transitions. [2018-12-02 07:50:31,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 580 transitions. [2018-12-02 07:50:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-02 07:50:31,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:31,132 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] [2018-12-02 07:50:31,132 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:31,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1393961092, now seen corresponding path program 1 times [2018-12-02 07:50:31,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:31,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:31,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:31,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:31,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:31,168 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-02 07:50:31,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:31,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:31,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:31,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:31,168 INFO L87 Difference]: Start difference. First operand 384 states and 580 transitions. Second operand 4 states. [2018-12-02 07:50:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:31,400 INFO L93 Difference]: Finished difference Result 839 states and 1279 transitions. [2018-12-02 07:50:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:31,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-02 07:50:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:31,402 INFO L225 Difference]: With dead ends: 839 [2018-12-02 07:50:31,402 INFO L226 Difference]: Without dead ends: 480 [2018-12-02 07:50:31,403 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-02 07:50:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-02 07:50:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 396. [2018-12-02 07:50:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-02 07:50:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 597 transitions. [2018-12-02 07:50:31,417 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 597 transitions. Word has length 137 [2018-12-02 07:50:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:31,417 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 597 transitions. [2018-12-02 07:50:31,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 597 transitions. [2018-12-02 07:50:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 07:50:31,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:31,418 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] [2018-12-02 07:50:31,418 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:31,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash -693644275, now seen corresponding path program 1 times [2018-12-02 07:50:31,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:31,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:31,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:31,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:31,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:31,454 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-02 07:50:31,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:31,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:31,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:31,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:31,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:31,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:31,455 INFO L87 Difference]: Start difference. First operand 396 states and 597 transitions. Second operand 4 states. [2018-12-02 07:50:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:31,687 INFO L93 Difference]: Finished difference Result 851 states and 1295 transitions. [2018-12-02 07:50:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:31,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-02 07:50:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:31,689 INFO L225 Difference]: With dead ends: 851 [2018-12-02 07:50:31,689 INFO L226 Difference]: Without dead ends: 480 [2018-12-02 07:50:31,690 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-02 07:50:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-02 07:50:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 397. [2018-12-02 07:50:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-02 07:50:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 598 transitions. [2018-12-02 07:50:31,704 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 598 transitions. Word has length 138 [2018-12-02 07:50:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:31,704 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 598 transitions. [2018-12-02 07:50:31,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 598 transitions. [2018-12-02 07:50:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-02 07:50:31,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:31,704 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] [2018-12-02 07:50:31,705 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:31,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:31,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2080428617, now seen corresponding path program 1 times [2018-12-02 07:50:31,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:31,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:31,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:31,738 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-02 07:50:31,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:31,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:31,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:31,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:31,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:31,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:31,738 INFO L87 Difference]: Start difference. First operand 397 states and 598 transitions. Second operand 4 states. [2018-12-02 07:50:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:31,962 INFO L93 Difference]: Finished difference Result 852 states and 1295 transitions. [2018-12-02 07:50:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:31,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-02 07:50:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:31,963 INFO L225 Difference]: With dead ends: 852 [2018-12-02 07:50:31,963 INFO L226 Difference]: Without dead ends: 480 [2018-12-02 07:50:31,963 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-02 07:50:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-02 07:50:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 398. [2018-12-02 07:50:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-12-02 07:50:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 599 transitions. [2018-12-02 07:50:31,977 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 599 transitions. Word has length 139 [2018-12-02 07:50:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:31,978 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 599 transitions. [2018-12-02 07:50:31,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 599 transitions. [2018-12-02 07:50:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 07:50:31,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:31,978 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] [2018-12-02 07:50:31,978 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:31,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:31,978 INFO L82 PathProgramCache]: Analyzing trace with hash 552127848, now seen corresponding path program 1 times [2018-12-02 07:50:31,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:31,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:31,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:31,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:31,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:32,017 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-02 07:50:32,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:32,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:32,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:32,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:32,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:32,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:32,018 INFO L87 Difference]: Start difference. First operand 398 states and 599 transitions. Second operand 4 states. [2018-12-02 07:50:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:32,237 INFO L93 Difference]: Finished difference Result 843 states and 1283 transitions. [2018-12-02 07:50:32,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:32,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-02 07:50:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:32,238 INFO L225 Difference]: With dead ends: 843 [2018-12-02 07:50:32,238 INFO L226 Difference]: Without dead ends: 470 [2018-12-02 07:50:32,239 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-02 07:50:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-02 07:50:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 399. [2018-12-02 07:50:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-02 07:50:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 600 transitions. [2018-12-02 07:50:32,253 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 600 transitions. Word has length 140 [2018-12-02 07:50:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:32,253 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 600 transitions. [2018-12-02 07:50:32,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 600 transitions. [2018-12-02 07:50:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 07:50:32,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:32,254 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] [2018-12-02 07:50:32,254 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:32,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1168460785, now seen corresponding path program 1 times [2018-12-02 07:50:32,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:32,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:32,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:32,286 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-02 07:50:32,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:32,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:32,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:32,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:32,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:32,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:32,286 INFO L87 Difference]: Start difference. First operand 399 states and 600 transitions. Second operand 4 states. [2018-12-02 07:50:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:32,533 INFO L93 Difference]: Finished difference Result 854 states and 1295 transitions. [2018-12-02 07:50:32,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:32,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-02 07:50:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:32,535 INFO L225 Difference]: With dead ends: 854 [2018-12-02 07:50:32,535 INFO L226 Difference]: Without dead ends: 480 [2018-12-02 07:50:32,535 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-02 07:50:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-02 07:50:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 399. [2018-12-02 07:50:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-02 07:50:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 599 transitions. [2018-12-02 07:50:32,550 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 599 transitions. Word has length 142 [2018-12-02 07:50:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:32,550 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 599 transitions. [2018-12-02 07:50:32,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 599 transitions. [2018-12-02 07:50:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 07:50:32,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:32,551 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] [2018-12-02 07:50:32,551 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:32,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:32,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2001897946, now seen corresponding path program 1 times [2018-12-02 07:50:32,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:32,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:32,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:32,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:32,580 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-02 07:50:32,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:32,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:32,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:32,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:32,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:32,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:32,581 INFO L87 Difference]: Start difference. First operand 399 states and 599 transitions. Second operand 4 states. [2018-12-02 07:50:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:32,847 INFO L93 Difference]: Finished difference Result 854 states and 1293 transitions. [2018-12-02 07:50:32,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:32,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-12-02 07:50:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:32,848 INFO L225 Difference]: With dead ends: 854 [2018-12-02 07:50:32,848 INFO L226 Difference]: Without dead ends: 480 [2018-12-02 07:50:32,848 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-02 07:50:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-02 07:50:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 399. [2018-12-02 07:50:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-02 07:50:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 598 transitions. [2018-12-02 07:50:32,864 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 598 transitions. Word has length 143 [2018-12-02 07:50:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:32,864 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 598 transitions. [2018-12-02 07:50:32,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 598 transitions. [2018-12-02 07:50:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 07:50:32,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:32,864 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] [2018-12-02 07:50:32,865 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:32,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash -122998390, now seen corresponding path program 1 times [2018-12-02 07:50:32,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:32,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:32,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:32,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:32,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:32,895 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-02 07:50:32,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:32,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:32,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:32,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:32,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:32,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:32,896 INFO L87 Difference]: Start difference. First operand 399 states and 598 transitions. Second operand 4 states. [2018-12-02 07:50:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:33,527 INFO L93 Difference]: Finished difference Result 854 states and 1291 transitions. [2018-12-02 07:50:33,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:33,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-02 07:50:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:33,529 INFO L225 Difference]: With dead ends: 854 [2018-12-02 07:50:33,530 INFO L226 Difference]: Without dead ends: 480 [2018-12-02 07:50:33,530 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-02 07:50:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-02 07:50:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 399. [2018-12-02 07:50:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-02 07:50:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 597 transitions. [2018-12-02 07:50:33,562 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 597 transitions. Word has length 144 [2018-12-02 07:50:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:33,562 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 597 transitions. [2018-12-02 07:50:33,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 597 transitions. [2018-12-02 07:50:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 07:50:33,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:33,563 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] [2018-12-02 07:50:33,563 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:33,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1102922741, now seen corresponding path program 1 times [2018-12-02 07:50:33,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:33,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:33,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:33,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:33,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:33,601 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-02 07:50:33,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:33,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:33,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:33,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:33,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:33,602 INFO L87 Difference]: Start difference. First operand 399 states and 597 transitions. Second operand 4 states. [2018-12-02 07:50:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:33,830 INFO L93 Difference]: Finished difference Result 844 states and 1277 transitions. [2018-12-02 07:50:33,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:33,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-02 07:50:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:33,831 INFO L225 Difference]: With dead ends: 844 [2018-12-02 07:50:33,831 INFO L226 Difference]: Without dead ends: 470 [2018-12-02 07:50:33,831 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-02 07:50:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-02 07:50:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 384. [2018-12-02 07:50:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-02 07:50:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 576 transitions. [2018-12-02 07:50:33,848 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 576 transitions. Word has length 145 [2018-12-02 07:50:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:33,848 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 576 transitions. [2018-12-02 07:50:33,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 576 transitions. [2018-12-02 07:50:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 07:50:33,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:33,848 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] [2018-12-02 07:50:33,849 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:33,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1178704546, now seen corresponding path program 1 times [2018-12-02 07:50:33,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:33,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:33,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:33,883 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-02 07:50:33,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:33,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:33,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:33,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:33,884 INFO L87 Difference]: Start difference. First operand 384 states and 576 transitions. Second operand 4 states. [2018-12-02 07:50:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:34,115 INFO L93 Difference]: Finished difference Result 829 states and 1255 transitions. [2018-12-02 07:50:34,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:34,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-02 07:50:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:34,116 INFO L225 Difference]: With dead ends: 829 [2018-12-02 07:50:34,116 INFO L226 Difference]: Without dead ends: 470 [2018-12-02 07:50:34,116 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-02 07:50:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-02 07:50:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 412. [2018-12-02 07:50:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-12-02 07:50:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 621 transitions. [2018-12-02 07:50:34,134 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 621 transitions. Word has length 147 [2018-12-02 07:50:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:34,134 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 621 transitions. [2018-12-02 07:50:34,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 621 transitions. [2018-12-02 07:50:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 07:50:34,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:34,134 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] [2018-12-02 07:50:34,134 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:34,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:34,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1897099021, now seen corresponding path program 1 times [2018-12-02 07:50:34,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:34,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:34,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:34,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:34,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:34,166 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-02 07:50:34,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:34,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:34,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:34,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:34,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:34,167 INFO L87 Difference]: Start difference. First operand 412 states and 621 transitions. Second operand 4 states. [2018-12-02 07:50:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:34,806 INFO L93 Difference]: Finished difference Result 849 states and 1286 transitions. [2018-12-02 07:50:34,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:34,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-02 07:50:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:34,811 INFO L225 Difference]: With dead ends: 849 [2018-12-02 07:50:34,811 INFO L226 Difference]: Without dead ends: 462 [2018-12-02 07:50:34,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-02 07:50:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-02 07:50:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 413. [2018-12-02 07:50:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-12-02 07:50:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 622 transitions. [2018-12-02 07:50:34,849 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 622 transitions. Word has length 148 [2018-12-02 07:50:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:34,849 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 622 transitions. [2018-12-02 07:50:34,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 622 transitions. [2018-12-02 07:50:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-02 07:50:34,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:34,850 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] [2018-12-02 07:50:34,850 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:34,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1056991384, now seen corresponding path program 1 times [2018-12-02 07:50:34,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:34,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:34,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:34,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:34,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:34,884 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-02 07:50:34,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:34,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:34,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:34,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:34,885 INFO L87 Difference]: Start difference. First operand 413 states and 622 transitions. Second operand 4 states. [2018-12-02 07:50:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:35,164 INFO L93 Difference]: Finished difference Result 850 states and 1286 transitions. [2018-12-02 07:50:35,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:35,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-02 07:50:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:35,165 INFO L225 Difference]: With dead ends: 850 [2018-12-02 07:50:35,165 INFO L226 Difference]: Without dead ends: 462 [2018-12-02 07:50:35,166 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-02 07:50:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-02 07:50:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 413. [2018-12-02 07:50:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-12-02 07:50:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 621 transitions. [2018-12-02 07:50:35,184 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 621 transitions. Word has length 150 [2018-12-02 07:50:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:35,184 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 621 transitions. [2018-12-02 07:50:35,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2018-12-02 07:50:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-02 07:50:35,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:35,184 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] [2018-12-02 07:50:35,185 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:35,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:35,185 INFO L82 PathProgramCache]: Analyzing trace with hash 582355175, now seen corresponding path program 1 times [2018-12-02 07:50:35,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:35,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:35,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:35,220 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-02 07:50:35,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:35,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:35,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:35,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:35,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:35,221 INFO L87 Difference]: Start difference. First operand 413 states and 621 transitions. Second operand 4 states. [2018-12-02 07:50:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:35,454 INFO L93 Difference]: Finished difference Result 848 states and 1282 transitions. [2018-12-02 07:50:35,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:35,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-02 07:50:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:35,456 INFO L225 Difference]: With dead ends: 848 [2018-12-02 07:50:35,457 INFO L226 Difference]: Without dead ends: 460 [2018-12-02 07:50:35,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:50:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-12-02 07:50:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 413. [2018-12-02 07:50:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-12-02 07:50:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 620 transitions. [2018-12-02 07:50:35,485 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 620 transitions. Word has length 151 [2018-12-02 07:50:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:35,485 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 620 transitions. [2018-12-02 07:50:35,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 620 transitions. [2018-12-02 07:50:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-02 07:50:35,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:35,486 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] [2018-12-02 07:50:35,487 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:35,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2104357786, now seen corresponding path program 1 times [2018-12-02 07:50:35,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:35,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:35,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:35,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:35,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:35,524 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-02 07:50:35,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:35,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:35,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:35,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:35,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:35,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:35,525 INFO L87 Difference]: Start difference. First operand 413 states and 620 transitions. Second operand 4 states. [2018-12-02 07:50:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:36,042 INFO L93 Difference]: Finished difference Result 845 states and 1276 transitions. [2018-12-02 07:50:36,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:36,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-02 07:50:36,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:36,045 INFO L225 Difference]: With dead ends: 845 [2018-12-02 07:50:36,045 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 07:50:36,046 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-02 07:50:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 07:50:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 416. [2018-12-02 07:50:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-02 07:50:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 625 transitions. [2018-12-02 07:50:36,065 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 625 transitions. Word has length 151 [2018-12-02 07:50:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:36,065 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 625 transitions. [2018-12-02 07:50:36,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 625 transitions. [2018-12-02 07:50:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-02 07:50:36,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:36,065 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] [2018-12-02 07:50:36,066 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:36,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:36,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1696872284, now seen corresponding path program 1 times [2018-12-02 07:50:36,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:36,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:36,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:36,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:36,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:36,096 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-02 07:50:36,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:36,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:36,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:36,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:36,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:36,096 INFO L87 Difference]: Start difference. First operand 416 states and 625 transitions. Second operand 4 states. [2018-12-02 07:50:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:36,306 INFO L93 Difference]: Finished difference Result 841 states and 1268 transitions. [2018-12-02 07:50:36,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:36,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-02 07:50:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:36,307 INFO L225 Difference]: With dead ends: 841 [2018-12-02 07:50:36,307 INFO L226 Difference]: Without dead ends: 450 [2018-12-02 07:50:36,308 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-02 07:50:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-02 07:50:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2018-12-02 07:50:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-02 07:50:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 624 transitions. [2018-12-02 07:50:36,327 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 624 transitions. Word has length 151 [2018-12-02 07:50:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:36,327 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 624 transitions. [2018-12-02 07:50:36,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 624 transitions. [2018-12-02 07:50:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 07:50:36,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:36,328 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] [2018-12-02 07:50:36,328 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:36,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:36,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1352801141, now seen corresponding path program 1 times [2018-12-02 07:50:36,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:36,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:36,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:36,365 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-02 07:50:36,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:36,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:36,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:36,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:36,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:36,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:36,366 INFO L87 Difference]: Start difference. First operand 416 states and 624 transitions. Second operand 4 states. [2018-12-02 07:50:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:36,764 INFO L93 Difference]: Finished difference Result 861 states and 1297 transitions. [2018-12-02 07:50:36,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:36,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 07:50:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:36,769 INFO L225 Difference]: With dead ends: 861 [2018-12-02 07:50:36,769 INFO L226 Difference]: Without dead ends: 470 [2018-12-02 07:50:36,770 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-02 07:50:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-02 07:50:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 416. [2018-12-02 07:50:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-02 07:50:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 623 transitions. [2018-12-02 07:50:36,811 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 623 transitions. Word has length 152 [2018-12-02 07:50:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:36,812 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 623 transitions. [2018-12-02 07:50:36,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 623 transitions. [2018-12-02 07:50:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 07:50:36,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:36,812 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] [2018-12-02 07:50:36,812 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:36,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:36,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1493956635, now seen corresponding path program 1 times [2018-12-02 07:50:36,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:36,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:36,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:36,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:36,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:36,850 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-02 07:50:36,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:36,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:36,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:36,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:36,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:36,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:36,851 INFO L87 Difference]: Start difference. First operand 416 states and 623 transitions. Second operand 4 states. [2018-12-02 07:50:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:37,069 INFO L93 Difference]: Finished difference Result 841 states and 1264 transitions. [2018-12-02 07:50:37,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:37,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 07:50:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:37,070 INFO L225 Difference]: With dead ends: 841 [2018-12-02 07:50:37,070 INFO L226 Difference]: Without dead ends: 450 [2018-12-02 07:50:37,071 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-02 07:50:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-02 07:50:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2018-12-02 07:50:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-02 07:50:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 622 transitions. [2018-12-02 07:50:37,093 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 622 transitions. Word has length 152 [2018-12-02 07:50:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:37,094 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 622 transitions. [2018-12-02 07:50:37,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 622 transitions. [2018-12-02 07:50:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 07:50:37,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:37,094 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] [2018-12-02 07:50:37,094 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:37,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash -795071872, now seen corresponding path program 1 times [2018-12-02 07:50:37,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:37,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:37,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:37,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:37,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:37,143 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-02 07:50:37,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:37,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:37,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:37,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:37,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:37,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:37,144 INFO L87 Difference]: Start difference. First operand 416 states and 622 transitions. Second operand 4 states. [2018-12-02 07:50:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:37,372 INFO L93 Difference]: Finished difference Result 853 states and 1280 transitions. [2018-12-02 07:50:37,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:37,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 07:50:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:37,374 INFO L225 Difference]: With dead ends: 853 [2018-12-02 07:50:37,374 INFO L226 Difference]: Without dead ends: 462 [2018-12-02 07:50:37,374 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-02 07:50:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-02 07:50:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 416. [2018-12-02 07:50:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-02 07:50:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 621 transitions. [2018-12-02 07:50:37,395 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 621 transitions. Word has length 153 [2018-12-02 07:50:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:37,395 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 621 transitions. [2018-12-02 07:50:37,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 621 transitions. [2018-12-02 07:50:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 07:50:37,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:37,396 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] [2018-12-02 07:50:37,396 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:37,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:37,396 INFO L82 PathProgramCache]: Analyzing trace with hash 640566716, now seen corresponding path program 1 times [2018-12-02 07:50:37,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:37,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:37,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:37,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:37,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:37,431 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-02 07:50:37,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:37,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:37,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:37,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:37,432 INFO L87 Difference]: Start difference. First operand 416 states and 621 transitions. Second operand 4 states. [2018-12-02 07:50:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:37,624 INFO L93 Difference]: Finished difference Result 848 states and 1272 transitions. [2018-12-02 07:50:37,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:37,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 07:50:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:37,625 INFO L225 Difference]: With dead ends: 848 [2018-12-02 07:50:37,625 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 07:50:37,625 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-02 07:50:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 07:50:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 417. [2018-12-02 07:50:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 07:50:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 622 transitions. [2018-12-02 07:50:37,645 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 622 transitions. Word has length 153 [2018-12-02 07:50:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:37,645 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 622 transitions. [2018-12-02 07:50:37,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 622 transitions. [2018-12-02 07:50:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 07:50:37,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:37,645 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] [2018-12-02 07:50:37,645 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:37,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:37,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1120308001, now seen corresponding path program 1 times [2018-12-02 07:50:37,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:37,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:37,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:37,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:37,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:37,679 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-02 07:50:37,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:37,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:37,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:37,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:37,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:37,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:37,680 INFO L87 Difference]: Start difference. First operand 417 states and 622 transitions. Second operand 4 states. [2018-12-02 07:50:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:37,889 INFO L93 Difference]: Finished difference Result 843 states and 1262 transitions. [2018-12-02 07:50:37,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:37,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 07:50:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:37,890 INFO L225 Difference]: With dead ends: 843 [2018-12-02 07:50:37,890 INFO L226 Difference]: Without dead ends: 451 [2018-12-02 07:50:37,891 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-02 07:50:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-02 07:50:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 417. [2018-12-02 07:50:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 07:50:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 621 transitions. [2018-12-02 07:50:37,912 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 621 transitions. Word has length 153 [2018-12-02 07:50:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:37,912 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 621 transitions. [2018-12-02 07:50:37,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 621 transitions. [2018-12-02 07:50:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 07:50:37,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:37,913 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] [2018-12-02 07:50:37,913 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:37,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash -213556974, now seen corresponding path program 1 times [2018-12-02 07:50:37,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:37,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:37,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:37,951 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-02 07:50:37,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:37,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:37,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:37,952 INFO L87 Difference]: Start difference. First operand 417 states and 621 transitions. Second operand 4 states. [2018-12-02 07:50:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:38,139 INFO L93 Difference]: Finished difference Result 845 states and 1265 transitions. [2018-12-02 07:50:38,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:38,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 07:50:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:38,140 INFO L225 Difference]: With dead ends: 845 [2018-12-02 07:50:38,140 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 07:50:38,141 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-02 07:50:38,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 07:50:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 418. [2018-12-02 07:50:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-12-02 07:50:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 622 transitions. [2018-12-02 07:50:38,161 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 622 transitions. Word has length 154 [2018-12-02 07:50:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:38,161 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 622 transitions. [2018-12-02 07:50:38,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 622 transitions. [2018-12-02 07:50:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 07:50:38,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:38,162 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] [2018-12-02 07:50:38,162 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:38,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:38,162 INFO L82 PathProgramCache]: Analyzing trace with hash 242980067, now seen corresponding path program 1 times [2018-12-02 07:50:38,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:38,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:38,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:38,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:38,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:38,199 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-02 07:50:38,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:38,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:38,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:38,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:38,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:38,200 INFO L87 Difference]: Start difference. First operand 418 states and 622 transitions. Second operand 4 states. [2018-12-02 07:50:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:38,418 INFO L93 Difference]: Finished difference Result 846 states and 1265 transitions. [2018-12-02 07:50:38,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:38,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 07:50:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:38,419 INFO L225 Difference]: With dead ends: 846 [2018-12-02 07:50:38,419 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 07:50:38,419 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-02 07:50:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 07:50:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 419. [2018-12-02 07:50:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 07:50:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 623 transitions. [2018-12-02 07:50:38,443 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 623 transitions. Word has length 154 [2018-12-02 07:50:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:38,443 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 623 transitions. [2018-12-02 07:50:38,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 623 transitions. [2018-12-02 07:50:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 07:50:38,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:38,444 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] [2018-12-02 07:50:38,444 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:38,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash 251095872, now seen corresponding path program 1 times [2018-12-02 07:50:38,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:38,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:38,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:38,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:38,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:38,477 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-02 07:50:38,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:38,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:38,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:38,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:38,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:38,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:38,478 INFO L87 Difference]: Start difference. First operand 419 states and 623 transitions. Second operand 4 states. [2018-12-02 07:50:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:38,681 INFO L93 Difference]: Finished difference Result 837 states and 1252 transitions. [2018-12-02 07:50:38,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:38,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 07:50:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:38,683 INFO L225 Difference]: With dead ends: 837 [2018-12-02 07:50:38,683 INFO L226 Difference]: Without dead ends: 443 [2018-12-02 07:50:38,683 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-02 07:50:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-02 07:50:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 419. [2018-12-02 07:50:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 07:50:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 622 transitions. [2018-12-02 07:50:38,713 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 622 transitions. Word has length 154 [2018-12-02 07:50:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:38,713 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 622 transitions. [2018-12-02 07:50:38,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 622 transitions. [2018-12-02 07:50:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 07:50:38,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:38,714 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] [2018-12-02 07:50:38,714 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:38,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash -751840539, now seen corresponding path program 1 times [2018-12-02 07:50:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:38,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:38,753 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-02 07:50:38,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:38,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:38,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:38,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:38,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:38,753 INFO L87 Difference]: Start difference. First operand 419 states and 622 transitions. Second operand 4 states. [2018-12-02 07:50:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:38,971 INFO L93 Difference]: Finished difference Result 856 states and 1274 transitions. [2018-12-02 07:50:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:38,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 07:50:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:38,972 INFO L225 Difference]: With dead ends: 856 [2018-12-02 07:50:38,972 INFO L226 Difference]: Without dead ends: 462 [2018-12-02 07:50:38,973 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-02 07:50:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-02 07:50:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 419. [2018-12-02 07:50:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 07:50:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 621 transitions. [2018-12-02 07:50:38,995 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 621 transitions. Word has length 155 [2018-12-02 07:50:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:38,996 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 621 transitions. [2018-12-02 07:50:38,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 621 transitions. [2018-12-02 07:50:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 07:50:38,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:38,996 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] [2018-12-02 07:50:38,997 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:38,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1459515309, now seen corresponding path program 1 times [2018-12-02 07:50:38,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:38,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:38,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:38,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:38,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:39,035 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-02 07:50:39,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:39,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:39,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:39,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:39,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:39,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:39,036 INFO L87 Difference]: Start difference. First operand 419 states and 621 transitions. Second operand 4 states. [2018-12-02 07:50:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:39,228 INFO L93 Difference]: Finished difference Result 845 states and 1259 transitions. [2018-12-02 07:50:39,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:39,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 07:50:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:39,229 INFO L225 Difference]: With dead ends: 845 [2018-12-02 07:50:39,229 INFO L226 Difference]: Without dead ends: 451 [2018-12-02 07:50:39,229 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-02 07:50:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-02 07:50:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 420. [2018-12-02 07:50:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-02 07:50:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 622 transitions. [2018-12-02 07:50:39,251 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 622 transitions. Word has length 155 [2018-12-02 07:50:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:39,251 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 622 transitions. [2018-12-02 07:50:39,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 622 transitions. [2018-12-02 07:50:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 07:50:39,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:39,252 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] [2018-12-02 07:50:39,252 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:39,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:39,252 INFO L82 PathProgramCache]: Analyzing trace with hash 343140410, now seen corresponding path program 1 times [2018-12-02 07:50:39,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:39,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:39,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:39,288 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-02 07:50:39,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:39,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:39,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:39,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:39,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:39,289 INFO L87 Difference]: Start difference. First operand 420 states and 622 transitions. Second operand 4 states. [2018-12-02 07:50:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:39,503 INFO L93 Difference]: Finished difference Result 855 states and 1270 transitions. [2018-12-02 07:50:39,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:39,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 07:50:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:39,504 INFO L225 Difference]: With dead ends: 855 [2018-12-02 07:50:39,504 INFO L226 Difference]: Without dead ends: 460 [2018-12-02 07:50:39,505 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-02 07:50:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-12-02 07:50:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2018-12-02 07:50:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-02 07:50:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 621 transitions. [2018-12-02 07:50:39,527 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 621 transitions. Word has length 156 [2018-12-02 07:50:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:39,527 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 621 transitions. [2018-12-02 07:50:39,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 621 transitions. [2018-12-02 07:50:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 07:50:39,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:39,527 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] [2018-12-02 07:50:39,527 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:39,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:39,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1865143021, now seen corresponding path program 1 times [2018-12-02 07:50:39,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:39,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:39,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:39,560 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-02 07:50:39,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:39,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:39,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:39,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:39,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:39,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:39,561 INFO L87 Difference]: Start difference. First operand 420 states and 621 transitions. Second operand 4 states. [2018-12-02 07:50:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:39,764 INFO L93 Difference]: Finished difference Result 852 states and 1264 transitions. [2018-12-02 07:50:39,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:39,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 07:50:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:39,765 INFO L225 Difference]: With dead ends: 852 [2018-12-02 07:50:39,765 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 07:50:39,765 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-02 07:50:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 07:50:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 420. [2018-12-02 07:50:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-02 07:50:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 620 transitions. [2018-12-02 07:50:39,787 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 620 transitions. Word has length 156 [2018-12-02 07:50:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:39,787 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 620 transitions. [2018-12-02 07:50:39,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 620 transitions. [2018-12-02 07:50:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 07:50:39,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:39,788 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] [2018-12-02 07:50:39,788 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:39,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash -88756834, now seen corresponding path program 1 times [2018-12-02 07:50:39,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:39,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:39,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:39,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:39,823 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-02 07:50:39,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:39,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:39,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:39,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:39,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:39,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:39,824 INFO L87 Difference]: Start difference. First operand 420 states and 620 transitions. Second operand 4 states. [2018-12-02 07:50:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:40,035 INFO L93 Difference]: Finished difference Result 846 states and 1255 transitions. [2018-12-02 07:50:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:40,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 07:50:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:40,036 INFO L225 Difference]: With dead ends: 846 [2018-12-02 07:50:40,036 INFO L226 Difference]: Without dead ends: 451 [2018-12-02 07:50:40,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:50:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-02 07:50:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 421. [2018-12-02 07:50:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-02 07:50:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 621 transitions. [2018-12-02 07:50:40,060 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 621 transitions. Word has length 156 [2018-12-02 07:50:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:40,060 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 621 transitions. [2018-12-02 07:50:40,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 621 transitions. [2018-12-02 07:50:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 07:50:40,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:40,061 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] [2018-12-02 07:50:40,061 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:40,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1599895224, now seen corresponding path program 1 times [2018-12-02 07:50:40,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:40,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:40,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:40,101 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-02 07:50:40,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:40,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:40,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:40,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:40,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:40,102 INFO L87 Difference]: Start difference. First operand 421 states and 621 transitions. Second operand 4 states. [2018-12-02 07:50:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:40,749 INFO L93 Difference]: Finished difference Result 845 states and 1253 transitions. [2018-12-02 07:50:40,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:40,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-02 07:50:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:40,753 INFO L225 Difference]: With dead ends: 845 [2018-12-02 07:50:40,753 INFO L226 Difference]: Without dead ends: 449 [2018-12-02 07:50:40,754 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-02 07:50:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-02 07:50:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 422. [2018-12-02 07:50:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 07:50:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 622 transitions. [2018-12-02 07:50:40,792 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 622 transitions. Word has length 157 [2018-12-02 07:50:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:40,792 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 622 transitions. [2018-12-02 07:50:40,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 622 transitions. [2018-12-02 07:50:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 07:50:40,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:40,793 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] [2018-12-02 07:50:40,793 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:40,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1611555761, now seen corresponding path program 1 times [2018-12-02 07:50:40,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:40,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:40,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:40,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:40,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:40,827 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-02 07:50:40,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:40,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:40,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:40,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:40,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:40,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:40,828 INFO L87 Difference]: Start difference. First operand 422 states and 622 transitions. Second operand 4 states. [2018-12-02 07:50:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:41,032 INFO L93 Difference]: Finished difference Result 854 states and 1262 transitions. [2018-12-02 07:50:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:41,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-02 07:50:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:41,033 INFO L225 Difference]: With dead ends: 854 [2018-12-02 07:50:41,033 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 07:50:41,033 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-02 07:50:41,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 07:50:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-12-02 07:50:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 07:50:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 621 transitions. [2018-12-02 07:50:41,056 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 621 transitions. Word has length 158 [2018-12-02 07:50:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:41,056 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 621 transitions. [2018-12-02 07:50:41,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 621 transitions. [2018-12-02 07:50:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 07:50:41,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:41,057 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] [2018-12-02 07:50:41,057 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:41,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1309877025, now seen corresponding path program 1 times [2018-12-02 07:50:41,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:41,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:41,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:41,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:41,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:41,089 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-02 07:50:41,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:41,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:41,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:41,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:41,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:41,090 INFO L87 Difference]: Start difference. First operand 422 states and 621 transitions. Second operand 4 states. [2018-12-02 07:50:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:41,295 INFO L93 Difference]: Finished difference Result 850 states and 1255 transitions. [2018-12-02 07:50:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:41,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-02 07:50:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:41,296 INFO L225 Difference]: With dead ends: 850 [2018-12-02 07:50:41,296 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 07:50:41,297 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-02 07:50:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 07:50:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2018-12-02 07:50:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 07:50:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 620 transitions. [2018-12-02 07:50:41,322 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 620 transitions. Word has length 159 [2018-12-02 07:50:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:41,322 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 620 transitions. [2018-12-02 07:50:41,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 620 transitions. [2018-12-02 07:50:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 07:50:41,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:41,323 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] [2018-12-02 07:50:41,323 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:41,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash -853339984, now seen corresponding path program 1 times [2018-12-02 07:50:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:41,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:41,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:41,361 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-02 07:50:41,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:41,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:41,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:41,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:41,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:41,362 INFO L87 Difference]: Start difference. First operand 422 states and 620 transitions. Second operand 4 states. [2018-12-02 07:50:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:41,583 INFO L93 Difference]: Finished difference Result 850 states and 1253 transitions. [2018-12-02 07:50:41,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:41,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-02 07:50:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:41,584 INFO L225 Difference]: With dead ends: 850 [2018-12-02 07:50:41,584 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 07:50:41,585 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-02 07:50:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 07:50:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2018-12-02 07:50:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 07:50:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 619 transitions. [2018-12-02 07:50:41,609 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 619 transitions. Word has length 159 [2018-12-02 07:50:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:41,609 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 619 transitions. [2018-12-02 07:50:41,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 619 transitions. [2018-12-02 07:50:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 07:50:41,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:41,610 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] [2018-12-02 07:50:41,610 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:41,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:41,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1833332096, now seen corresponding path program 1 times [2018-12-02 07:50:41,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:41,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:41,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:41,645 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-02 07:50:41,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:41,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:41,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:41,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:41,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:41,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:41,646 INFO L87 Difference]: Start difference. First operand 422 states and 619 transitions. Second operand 4 states. [2018-12-02 07:50:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:41,855 INFO L93 Difference]: Finished difference Result 848 states and 1249 transitions. [2018-12-02 07:50:41,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:41,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-02 07:50:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:41,856 INFO L225 Difference]: With dead ends: 848 [2018-12-02 07:50:41,856 INFO L226 Difference]: Without dead ends: 451 [2018-12-02 07:50:41,856 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-02 07:50:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-02 07:50:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 422. [2018-12-02 07:50:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 07:50:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 618 transitions. [2018-12-02 07:50:41,881 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 618 transitions. Word has length 160 [2018-12-02 07:50:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:41,881 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 618 transitions. [2018-12-02 07:50:41,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 618 transitions. [2018-12-02 07:50:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 07:50:41,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:41,882 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] [2018-12-02 07:50:41,882 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:41,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1385338325, now seen corresponding path program 1 times [2018-12-02 07:50:41,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:41,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:41,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:41,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:41,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:41,925 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-02 07:50:41,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:41,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:41,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:41,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:41,926 INFO L87 Difference]: Start difference. First operand 422 states and 618 transitions. Second operand 4 states. [2018-12-02 07:50:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:42,151 INFO L93 Difference]: Finished difference Result 848 states and 1247 transitions. [2018-12-02 07:50:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:42,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-02 07:50:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:42,152 INFO L225 Difference]: With dead ends: 848 [2018-12-02 07:50:42,152 INFO L226 Difference]: Without dead ends: 451 [2018-12-02 07:50:42,153 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-02 07:50:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-02 07:50:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 422. [2018-12-02 07:50:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 07:50:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 617 transitions. [2018-12-02 07:50:42,178 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 617 transitions. Word has length 161 [2018-12-02 07:50:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:42,178 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 617 transitions. [2018-12-02 07:50:42,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 617 transitions. [2018-12-02 07:50:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 07:50:42,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:42,179 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] [2018-12-02 07:50:42,179 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:42,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:42,179 INFO L82 PathProgramCache]: Analyzing trace with hash -889833014, now seen corresponding path program 1 times [2018-12-02 07:50:42,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:42,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:42,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:42,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:42,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:42,217 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-02 07:50:42,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:42,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:42,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:42,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:42,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:42,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:42,218 INFO L87 Difference]: Start difference. First operand 422 states and 617 transitions. Second operand 4 states. [2018-12-02 07:50:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:42,451 INFO L93 Difference]: Finished difference Result 885 states and 1308 transitions. [2018-12-02 07:50:42,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:42,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-02 07:50:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:42,452 INFO L225 Difference]: With dead ends: 885 [2018-12-02 07:50:42,452 INFO L226 Difference]: Without dead ends: 488 [2018-12-02 07:50:42,452 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-02 07:50:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-02 07:50:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 452. [2018-12-02 07:50:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-02 07:50:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 670 transitions. [2018-12-02 07:50:42,477 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 670 transitions. Word has length 161 [2018-12-02 07:50:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:42,477 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 670 transitions. [2018-12-02 07:50:42,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 670 transitions. [2018-12-02 07:50:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 07:50:42,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:42,478 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] [2018-12-02 07:50:42,478 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:42,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1155751515, now seen corresponding path program 1 times [2018-12-02 07:50:42,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:42,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:42,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:42,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:42,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:42,520 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-02 07:50:42,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:42,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:42,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:42,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:42,521 INFO L87 Difference]: Start difference. First operand 452 states and 670 transitions. Second operand 4 states. [2018-12-02 07:50:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:42,725 INFO L93 Difference]: Finished difference Result 906 states and 1349 transitions. [2018-12-02 07:50:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:42,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-02 07:50:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:42,726 INFO L225 Difference]: With dead ends: 906 [2018-12-02 07:50:42,726 INFO L226 Difference]: Without dead ends: 479 [2018-12-02 07:50:42,726 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-02 07:50:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-12-02 07:50:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 414. [2018-12-02 07:50:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-12-02 07:50:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 614 transitions. [2018-12-02 07:50:42,751 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 614 transitions. Word has length 162 [2018-12-02 07:50:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:42,751 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 614 transitions. [2018-12-02 07:50:42,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 614 transitions. [2018-12-02 07:50:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 07:50:42,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:42,752 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] [2018-12-02 07:50:42,752 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:42,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:42,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1196295291, now seen corresponding path program 1 times [2018-12-02 07:50:42,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:42,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:42,787 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-02 07:50:42,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:42,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:42,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:42,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:42,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:42,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:42,787 INFO L87 Difference]: Start difference. First operand 414 states and 614 transitions. Second operand 4 states. [2018-12-02 07:50:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:43,024 INFO L93 Difference]: Finished difference Result 868 states and 1292 transitions. [2018-12-02 07:50:43,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:43,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-02 07:50:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:43,025 INFO L225 Difference]: With dead ends: 868 [2018-12-02 07:50:43,025 INFO L226 Difference]: Without dead ends: 479 [2018-12-02 07:50:43,025 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-02 07:50:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-12-02 07:50:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 444. [2018-12-02 07:50:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-02 07:50:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 659 transitions. [2018-12-02 07:50:43,054 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 659 transitions. Word has length 164 [2018-12-02 07:50:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:43,054 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 659 transitions. [2018-12-02 07:50:43,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 659 transitions. [2018-12-02 07:50:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 07:50:43,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:43,055 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] [2018-12-02 07:50:43,055 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:43,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1445304432, now seen corresponding path program 1 times [2018-12-02 07:50:43,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:43,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:43,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:43,087 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-02 07:50:43,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:43,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:43,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:43,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:43,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:43,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:43,088 INFO L87 Difference]: Start difference. First operand 444 states and 659 transitions. Second operand 4 states. [2018-12-02 07:50:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:43,342 INFO L93 Difference]: Finished difference Result 902 states and 1342 transitions. [2018-12-02 07:50:43,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:43,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-02 07:50:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:43,343 INFO L225 Difference]: With dead ends: 902 [2018-12-02 07:50:43,343 INFO L226 Difference]: Without dead ends: 483 [2018-12-02 07:50:43,344 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-02 07:50:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-02 07:50:43,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 444. [2018-12-02 07:50:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-02 07:50:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 658 transitions. [2018-12-02 07:50:43,372 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 658 transitions. Word has length 164 [2018-12-02 07:50:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:43,372 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 658 transitions. [2018-12-02 07:50:43,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 658 transitions. [2018-12-02 07:50:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 07:50:43,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:43,373 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] [2018-12-02 07:50:43,373 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:43,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1626017385, now seen corresponding path program 1 times [2018-12-02 07:50:43,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:43,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:43,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:43,410 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-02 07:50:43,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:43,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:43,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:43,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:43,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:43,411 INFO L87 Difference]: Start difference. First operand 444 states and 658 transitions. Second operand 4 states. [2018-12-02 07:50:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:43,591 INFO L93 Difference]: Finished difference Result 876 states and 1306 transitions. [2018-12-02 07:50:43,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:43,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-02 07:50:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:43,592 INFO L225 Difference]: With dead ends: 876 [2018-12-02 07:50:43,592 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 07:50:43,592 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-02 07:50:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 07:50:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 444. [2018-12-02 07:50:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-02 07:50:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 657 transitions. [2018-12-02 07:50:43,618 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 657 transitions. Word has length 165 [2018-12-02 07:50:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:43,618 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 657 transitions. [2018-12-02 07:50:43,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 657 transitions. [2018-12-02 07:50:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 07:50:43,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:43,619 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] [2018-12-02 07:50:43,619 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:43,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:43,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1424241049, now seen corresponding path program 1 times [2018-12-02 07:50:43,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:43,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:43,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:43,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:43,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:43,650 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-02 07:50:43,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:43,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:43,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:43,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:43,651 INFO L87 Difference]: Start difference. First operand 444 states and 657 transitions. Second operand 4 states. [2018-12-02 07:50:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:43,883 INFO L93 Difference]: Finished difference Result 902 states and 1338 transitions. [2018-12-02 07:50:43,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:43,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-02 07:50:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:43,884 INFO L225 Difference]: With dead ends: 902 [2018-12-02 07:50:43,884 INFO L226 Difference]: Without dead ends: 483 [2018-12-02 07:50:43,885 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-02 07:50:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-02 07:50:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 444. [2018-12-02 07:50:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-02 07:50:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 656 transitions. [2018-12-02 07:50:43,913 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 656 transitions. Word has length 165 [2018-12-02 07:50:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:43,913 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 656 transitions. [2018-12-02 07:50:43,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 656 transitions. [2018-12-02 07:50:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-02 07:50:43,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:43,914 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] [2018-12-02 07:50:43,914 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:43,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:43,914 INFO L82 PathProgramCache]: Analyzing trace with hash -850493013, now seen corresponding path program 1 times [2018-12-02 07:50:43,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:43,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:43,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:43,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:43,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:43,971 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-02 07:50:43,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:43,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:43,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:43,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:43,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:43,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:43,972 INFO L87 Difference]: Start difference. First operand 444 states and 656 transitions. Second operand 4 states. [2018-12-02 07:50:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:44,180 INFO L93 Difference]: Finished difference Result 887 states and 1318 transitions. [2018-12-02 07:50:44,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:44,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-02 07:50:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:44,181 INFO L225 Difference]: With dead ends: 887 [2018-12-02 07:50:44,181 INFO L226 Difference]: Without dead ends: 468 [2018-12-02 07:50:44,182 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-02 07:50:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-02 07:50:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 444. [2018-12-02 07:50:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-02 07:50:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 655 transitions. [2018-12-02 07:50:44,208 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 655 transitions. Word has length 166 [2018-12-02 07:50:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:44,208 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 655 transitions. [2018-12-02 07:50:44,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 655 transitions. [2018-12-02 07:50:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-02 07:50:44,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:44,209 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] [2018-12-02 07:50:44,209 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:44,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 938734207, now seen corresponding path program 1 times [2018-12-02 07:50:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:44,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:44,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:44,276 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-02 07:50:44,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:44,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:50:44,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:44,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:50:44,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:50:44,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:50:44,277 INFO L87 Difference]: Start difference. First operand 444 states and 655 transitions. Second operand 5 states. [2018-12-02 07:50:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:44,618 INFO L93 Difference]: Finished difference Result 939 states and 1399 transitions. [2018-12-02 07:50:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:50:44,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2018-12-02 07:50:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:44,620 INFO L225 Difference]: With dead ends: 939 [2018-12-02 07:50:44,620 INFO L226 Difference]: Without dead ends: 520 [2018-12-02 07:50:44,620 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-02 07:50:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-12-02 07:50:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 477. [2018-12-02 07:50:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-02 07:50:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 714 transitions. [2018-12-02 07:50:44,649 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 714 transitions. Word has length 166 [2018-12-02 07:50:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:44,649 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 714 transitions. [2018-12-02 07:50:44,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:50:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 714 transitions. [2018-12-02 07:50:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 07:50:44,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:44,649 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] [2018-12-02 07:50:44,650 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:44,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash 671043978, now seen corresponding path program 1 times [2018-12-02 07:50:44,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:44,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:44,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:44,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:44,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:44,686 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-02 07:50:44,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:44,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:44,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:44,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:44,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:44,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:44,687 INFO L87 Difference]: Start difference. First operand 477 states and 714 transitions. Second operand 4 states. [2018-12-02 07:50:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:44,880 INFO L93 Difference]: Finished difference Result 951 states and 1432 transitions. [2018-12-02 07:50:44,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:44,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 07:50:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:44,880 INFO L225 Difference]: With dead ends: 951 [2018-12-02 07:50:44,880 INFO L226 Difference]: Without dead ends: 499 [2018-12-02 07:50:44,881 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-02 07:50:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-12-02 07:50:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 477. [2018-12-02 07:50:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-02 07:50:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 713 transitions. [2018-12-02 07:50:44,909 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 713 transitions. Word has length 167 [2018-12-02 07:50:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:44,909 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 713 transitions. [2018-12-02 07:50:44,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 713 transitions. [2018-12-02 07:50:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 07:50:44,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:44,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, 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] [2018-12-02 07:50:44,910 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:44,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2050751574, now seen corresponding path program 1 times [2018-12-02 07:50:44,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:44,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:44,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:44,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:44,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-12-02 07:50:44,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:44,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:50:44,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:44,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:50:44,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:50:44,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:50:44,940 INFO L87 Difference]: Start difference. First operand 477 states and 713 transitions. Second operand 3 states. [2018-12-02 07:50:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:45,017 INFO L93 Difference]: Finished difference Result 1375 states and 2077 transitions. [2018-12-02 07:50:45,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:50:45,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-12-02 07:50:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:45,019 INFO L225 Difference]: With dead ends: 1375 [2018-12-02 07:50:45,019 INFO L226 Difference]: Without dead ends: 923 [2018-12-02 07:50:45,019 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-02 07:50:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-02 07:50:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2018-12-02 07:50:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-12-02 07:50:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1385 transitions. [2018-12-02 07:50:45,075 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1385 transitions. Word has length 170 [2018-12-02 07:50:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:45,075 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1385 transitions. [2018-12-02 07:50:45,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:50:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1385 transitions. [2018-12-02 07:50:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-02 07:50:45,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:45,076 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] [2018-12-02 07:50:45,076 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:45,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash -633879184, now seen corresponding path program 1 times [2018-12-02 07:50:45,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:45,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:45,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:45,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:45,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 07:50:45,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:45,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:50:45,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:45,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:50:45,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:50:45,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:50:45,114 INFO L87 Difference]: Start difference. First operand 923 states and 1385 transitions. Second operand 3 states. [2018-12-02 07:50:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:45,209 INFO L93 Difference]: Finished difference Result 2265 states and 3416 transitions. [2018-12-02 07:50:45,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:50:45,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2018-12-02 07:50:45,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:45,211 INFO L225 Difference]: With dead ends: 2265 [2018-12-02 07:50:45,211 INFO L226 Difference]: Without dead ends: 1367 [2018-12-02 07:50:45,212 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-02 07:50:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-12-02 07:50:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2018-12-02 07:50:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2018-12-02 07:50:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2052 transitions. [2018-12-02 07:50:45,294 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2052 transitions. Word has length 171 [2018-12-02 07:50:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:45,295 INFO L480 AbstractCegarLoop]: Abstraction has 1365 states and 2052 transitions. [2018-12-02 07:50:45,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:50:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2052 transitions. [2018-12-02 07:50:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-02 07:50:45,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:45,296 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] [2018-12-02 07:50:45,296 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:45,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash 88033091, now seen corresponding path program 1 times [2018-12-02 07:50:45,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:45,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:45,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:45,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:45,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:45,343 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-02 07:50:45,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:45,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:45,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:45,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:45,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:45,344 INFO L87 Difference]: Start difference. First operand 1365 states and 2052 transitions. Second operand 4 states. [2018-12-02 07:50:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:45,626 INFO L93 Difference]: Finished difference Result 2808 states and 4204 transitions. [2018-12-02 07:50:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:45,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-12-02 07:50:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:45,628 INFO L225 Difference]: With dead ends: 2808 [2018-12-02 07:50:45,628 INFO L226 Difference]: Without dead ends: 1468 [2018-12-02 07:50:45,629 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-02 07:50:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-12-02 07:50:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1275. [2018-12-02 07:50:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2018-12-02 07:50:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1914 transitions. [2018-12-02 07:50:45,711 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1914 transitions. Word has length 171 [2018-12-02 07:50:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:45,711 INFO L480 AbstractCegarLoop]: Abstraction has 1275 states and 1914 transitions. [2018-12-02 07:50:45,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1914 transitions. [2018-12-02 07:50:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 07:50:45,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:45,713 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] [2018-12-02 07:50:45,713 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:45,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1796124408, now seen corresponding path program 1 times [2018-12-02 07:50:45,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:45,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:45,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:45,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:45,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:45,763 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-02 07:50:45,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:45,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:45,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:45,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:45,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:45,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:45,764 INFO L87 Difference]: Start difference. First operand 1275 states and 1914 transitions. Second operand 4 states. [2018-12-02 07:50:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:46,089 INFO L93 Difference]: Finished difference Result 2712 states and 4057 transitions. [2018-12-02 07:50:46,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:46,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-12-02 07:50:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:46,091 INFO L225 Difference]: With dead ends: 2712 [2018-12-02 07:50:46,091 INFO L226 Difference]: Without dead ends: 1462 [2018-12-02 07:50:46,092 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-02 07:50:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2018-12-02 07:50:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1368. [2018-12-02 07:50:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-12-02 07:50:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2052 transitions. [2018-12-02 07:50:46,173 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2052 transitions. Word has length 172 [2018-12-02 07:50:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:46,173 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2052 transitions. [2018-12-02 07:50:46,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2052 transitions. [2018-12-02 07:50:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 07:50:46,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:46,174 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] [2018-12-02 07:50:46,175 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:46,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:46,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2065488547, now seen corresponding path program 1 times [2018-12-02 07:50:46,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:46,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:46,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:46,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:46,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-02 07:50:46,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:46,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:50:46,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:46,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:50:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:50:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:50:46,211 INFO L87 Difference]: Start difference. First operand 1368 states and 2052 transitions. Second operand 3 states. [2018-12-02 07:50:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:46,347 INFO L93 Difference]: Finished difference Result 3126 states and 4706 transitions. [2018-12-02 07:50:46,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:50:46,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-02 07:50:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:46,349 INFO L225 Difference]: With dead ends: 3126 [2018-12-02 07:50:46,349 INFO L226 Difference]: Without dead ends: 1783 [2018-12-02 07:50:46,350 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-02 07:50:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2018-12-02 07:50:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1779. [2018-12-02 07:50:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2018-12-02 07:50:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2673 transitions. [2018-12-02 07:50:46,459 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2673 transitions. Word has length 172 [2018-12-02 07:50:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:46,459 INFO L480 AbstractCegarLoop]: Abstraction has 1779 states and 2673 transitions. [2018-12-02 07:50:46,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:50:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2673 transitions. [2018-12-02 07:50:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 07:50:46,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:46,460 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] [2018-12-02 07:50:46,460 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:46,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:46,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1630982949, now seen corresponding path program 1 times [2018-12-02 07:50:46,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:46,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:46,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:46,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:46,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 07:50:46,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:46,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:50:46,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:46,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:50:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:50:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:50:46,483 INFO L87 Difference]: Start difference. First operand 1779 states and 2673 transitions. Second operand 3 states. [2018-12-02 07:50:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:46,600 INFO L93 Difference]: Finished difference Result 3560 states and 5355 transitions. [2018-12-02 07:50:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:50:46,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-02 07:50:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:46,602 INFO L225 Difference]: With dead ends: 3560 [2018-12-02 07:50:46,602 INFO L226 Difference]: Without dead ends: 1806 [2018-12-02 07:50:46,603 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-02 07:50:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2018-12-02 07:50:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1806. [2018-12-02 07:50:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2018-12-02 07:50:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2708 transitions. [2018-12-02 07:50:46,718 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2708 transitions. Word has length 172 [2018-12-02 07:50:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:46,719 INFO L480 AbstractCegarLoop]: Abstraction has 1806 states and 2708 transitions. [2018-12-02 07:50:46,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:50:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2708 transitions. [2018-12-02 07:50:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 07:50:46,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:46,720 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] [2018-12-02 07:50:46,720 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:46,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:46,720 INFO L82 PathProgramCache]: Analyzing trace with hash -732858713, now seen corresponding path program 1 times [2018-12-02 07:50:46,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:46,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:46,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:46,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:46,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-02 07:50:46,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:46,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:50:46,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:46,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:50:46,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:50:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:50:46,741 INFO L87 Difference]: Start difference. First operand 1806 states and 2708 transitions. Second operand 3 states. [2018-12-02 07:50:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:46,857 INFO L93 Difference]: Finished difference Result 3589 states and 5391 transitions. [2018-12-02 07:50:46,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:50:46,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-02 07:50:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:46,858 INFO L225 Difference]: With dead ends: 3589 [2018-12-02 07:50:46,858 INFO L226 Difference]: Without dead ends: 1808 [2018-12-02 07:50:46,859 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-02 07:50:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2018-12-02 07:50:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2018-12-02 07:50:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-02 07:50:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2710 transitions. [2018-12-02 07:50:46,978 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2710 transitions. Word has length 172 [2018-12-02 07:50:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:46,978 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2710 transitions. [2018-12-02 07:50:46,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:50:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2710 transitions. [2018-12-02 07:50:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 07:50:46,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:46,979 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] [2018-12-02 07:50:46,979 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:46,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash -623444499, now seen corresponding path program 1 times [2018-12-02 07:50:46,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:46,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:47,015 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-02 07:50:47,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:47,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:47,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:47,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:47,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:47,016 INFO L87 Difference]: Start difference. First operand 1808 states and 2710 transitions. Second operand 4 states. [2018-12-02 07:50:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:47,392 INFO L93 Difference]: Finished difference Result 3734 states and 5577 transitions. [2018-12-02 07:50:47,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:47,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-12-02 07:50:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:47,394 INFO L225 Difference]: With dead ends: 3734 [2018-12-02 07:50:47,394 INFO L226 Difference]: Without dead ends: 1953 [2018-12-02 07:50:47,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-02 07:50:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2018-12-02 07:50:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1808. [2018-12-02 07:50:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-02 07:50:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2706 transitions. [2018-12-02 07:50:47,512 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2706 transitions. Word has length 176 [2018-12-02 07:50:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:47,512 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2706 transitions. [2018-12-02 07:50:47,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2706 transitions. [2018-12-02 07:50:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 07:50:47,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:47,513 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] [2018-12-02 07:50:47,513 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:47,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1717533628, now seen corresponding path program 1 times [2018-12-02 07:50:47,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:47,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:47,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:47,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:47,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:47,554 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-02 07:50:47,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:47,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:47,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:47,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:47,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:47,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:47,554 INFO L87 Difference]: Start difference. First operand 1808 states and 2706 transitions. Second operand 4 states. [2018-12-02 07:50:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:47,958 INFO L93 Difference]: Finished difference Result 3734 states and 5569 transitions. [2018-12-02 07:50:47,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:47,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-12-02 07:50:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:47,960 INFO L225 Difference]: With dead ends: 3734 [2018-12-02 07:50:47,960 INFO L226 Difference]: Without dead ends: 1953 [2018-12-02 07:50:47,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-02 07:50:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2018-12-02 07:50:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1808. [2018-12-02 07:50:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-02 07:50:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2702 transitions. [2018-12-02 07:50:48,080 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2702 transitions. Word has length 177 [2018-12-02 07:50:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:48,080 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2702 transitions. [2018-12-02 07:50:48,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2702 transitions. [2018-12-02 07:50:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 07:50:48,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:48,081 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] [2018-12-02 07:50:48,081 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:48,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash -348357656, now seen corresponding path program 1 times [2018-12-02 07:50:48,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:48,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:48,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:48,124 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-02 07:50:48,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:48,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:48,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:48,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:48,125 INFO L87 Difference]: Start difference. First operand 1808 states and 2702 transitions. Second operand 4 states. [2018-12-02 07:50:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:48,505 INFO L93 Difference]: Finished difference Result 3734 states and 5561 transitions. [2018-12-02 07:50:48,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:48,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-02 07:50:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:48,507 INFO L225 Difference]: With dead ends: 3734 [2018-12-02 07:50:48,507 INFO L226 Difference]: Without dead ends: 1953 [2018-12-02 07:50:48,509 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-02 07:50:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2018-12-02 07:50:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1808. [2018-12-02 07:50:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-02 07:50:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2698 transitions. [2018-12-02 07:50:48,629 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2698 transitions. Word has length 178 [2018-12-02 07:50:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:48,629 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2698 transitions. [2018-12-02 07:50:48,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2698 transitions. [2018-12-02 07:50:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 07:50:48,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:48,630 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] [2018-12-02 07:50:48,630 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:48,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:48,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1588247209, now seen corresponding path program 1 times [2018-12-02 07:50:48,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:48,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:48,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:48,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:48,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:48,671 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-02 07:50:48,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:48,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:48,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:48,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:48,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:48,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:48,671 INFO L87 Difference]: Start difference. First operand 1808 states and 2698 transitions. Second operand 4 states. [2018-12-02 07:50:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:49,039 INFO L93 Difference]: Finished difference Result 3694 states and 5505 transitions. [2018-12-02 07:50:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:49,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-02 07:50:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:49,041 INFO L225 Difference]: With dead ends: 3694 [2018-12-02 07:50:49,042 INFO L226 Difference]: Without dead ends: 1913 [2018-12-02 07:50:49,043 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-02 07:50:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2018-12-02 07:50:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1808. [2018-12-02 07:50:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-02 07:50:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2694 transitions. [2018-12-02 07:50:49,163 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2694 transitions. Word has length 179 [2018-12-02 07:50:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:49,163 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2694 transitions. [2018-12-02 07:50:49,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2694 transitions. [2018-12-02 07:50:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-02 07:50:49,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:49,164 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] [2018-12-02 07:50:49,164 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:49,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2016140136, now seen corresponding path program 1 times [2018-12-02 07:50:49,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:49,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:49,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:49,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:49,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:49,234 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-02 07:50:49,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:49,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:50:49,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:49,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:50:49,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:50:49,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:50:49,234 INFO L87 Difference]: Start difference. First operand 1808 states and 2694 transitions. Second operand 5 states. [2018-12-02 07:50:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:49,695 INFO L93 Difference]: Finished difference Result 4033 states and 6031 transitions. [2018-12-02 07:50:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:49,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2018-12-02 07:50:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:49,697 INFO L225 Difference]: With dead ends: 4033 [2018-12-02 07:50:49,697 INFO L226 Difference]: Without dead ends: 2252 [2018-12-02 07:50:49,698 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-02 07:50:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2018-12-02 07:50:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1967. [2018-12-02 07:50:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 07:50:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2981 transitions. [2018-12-02 07:50:49,822 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2981 transitions. Word has length 181 [2018-12-02 07:50:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:49,822 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 2981 transitions. [2018-12-02 07:50:49,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:50:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2981 transitions. [2018-12-02 07:50:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-02 07:50:49,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:49,823 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] [2018-12-02 07:50:49,823 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:49,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1917662408, now seen corresponding path program 1 times [2018-12-02 07:50:49,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:49,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:49,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:49,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:49,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:49,887 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-02 07:50:49,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:49,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:50:49,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:49,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:50:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:50:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:50:49,888 INFO L87 Difference]: Start difference. First operand 1967 states and 2981 transitions. Second operand 5 states. [2018-12-02 07:50:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:50,378 INFO L93 Difference]: Finished difference Result 4304 states and 6538 transitions. [2018-12-02 07:50:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:50,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2018-12-02 07:50:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:50,380 INFO L225 Difference]: With dead ends: 4304 [2018-12-02 07:50:50,380 INFO L226 Difference]: Without dead ends: 2364 [2018-12-02 07:50:50,381 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-02 07:50:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2018-12-02 07:50:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2075. [2018-12-02 07:50:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2018-12-02 07:50:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3201 transitions. [2018-12-02 07:50:50,507 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3201 transitions. Word has length 182 [2018-12-02 07:50:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:50,507 INFO L480 AbstractCegarLoop]: Abstraction has 2075 states and 3201 transitions. [2018-12-02 07:50:50,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:50:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3201 transitions. [2018-12-02 07:50:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-02 07:50:50,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:50,508 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:50:50,508 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:50,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:50,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2038858637, now seen corresponding path program 1 times [2018-12-02 07:50:50,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:50,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:50,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-02 07:50:50,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:50:50,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:50:50,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:50,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:50:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:50:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:50:50,564 INFO L87 Difference]: Start difference. First operand 2075 states and 3201 transitions. Second operand 4 states. [2018-12-02 07:50:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:50,916 INFO L93 Difference]: Finished difference Result 4208 states and 6491 transitions. [2018-12-02 07:50:50,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:50:50,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-12-02 07:50:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:50,919 INFO L225 Difference]: With dead ends: 4208 [2018-12-02 07:50:50,919 INFO L226 Difference]: Without dead ends: 2160 [2018-12-02 07:50:50,921 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-02 07:50:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2018-12-02 07:50:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2075. [2018-12-02 07:50:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2018-12-02 07:50:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3197 transitions. [2018-12-02 07:50:51,049 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3197 transitions. Word has length 194 [2018-12-02 07:50:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:51,049 INFO L480 AbstractCegarLoop]: Abstraction has 2075 states and 3197 transitions. [2018-12-02 07:50:51,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:50:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3197 transitions. [2018-12-02 07:50:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-02 07:50:51,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:51,051 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] [2018-12-02 07:50:51,051 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:51,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:51,051 INFO L82 PathProgramCache]: Analyzing trace with hash -909303882, now seen corresponding path program 1 times [2018-12-02 07:50:51,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:51,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:51,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:51,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:51,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 07:50:51,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:50:51,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:50:51,598 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-12-02 07:50:51,599 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], [323], [325], [328], [332], [337], [342], [377], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:50:51,622 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:50:51,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:50:52,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:50:52,179 INFO L272 AbstractInterpreter]: Visited 83 different actions 349 times. Merged at 68 different actions 245 times. Never widened. Performed 2761 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2761 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 13 different actions. Largest state had 137 variables. [2018-12-02 07:50:52,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:52,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:50:52,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:50:52,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/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-02 07:50:52,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:52,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:50:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:52,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:50:52,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,366 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-02 07:50:52,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,382 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-02 07:50:52,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,408 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-02 07:50:52,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,433 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-02 07:50:52,435 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-02 07:50:52,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,438 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-02 07:50:52,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,443 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-02 07:50:52,443 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,453 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,457 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,473 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-02 07:50:52,474 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 07:50:52,513 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-02 07:50:52,515 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-02 07:50:52,532 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-02 07:50:52,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,540 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-02 07:50:52,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,569 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-02 07:50:52,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,577 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-02 07:50:52,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,590 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-02 07:50:52,591 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,606 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,620 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 07:50:52,643 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-02 07:50:52,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,649 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-02 07:50:52,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:50:52,675 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-02 07:50:52,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,683 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-02 07:50:52,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:50:52,714 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-02 07:50:52,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,722 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-02 07:50:52,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,746 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-02 07:50:52,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,755 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-02 07:50:52,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:50:52,778 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-02 07:50:52,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,785 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-02 07:50:52,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:50:52,807 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-02 07:50:52,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,813 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-02 07:50:52,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:50:52,834 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-02 07:50:52,836 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-02 07:50:52,851 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-02 07:50:52,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,859 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-02 07:50:52,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:52,875 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-02 07:50:52,875 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,914 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:50:52,923 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 131 [2018-12-02 07:50:52,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 07:50:52,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,946 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 159 treesize of output 153 [2018-12-02 07:50:52,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 07:50:52,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,966 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 31 treesize of output 22 [2018-12-02 07:50:52,968 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-02 07:50:52,968 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:52,979 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:208, output treesize:100 [2018-12-02 07:50:53,017 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 39 [2018-12-02 07:50:53,018 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 39 treesize of output 31 [2018-12-02 07:50:53,019 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-02 07:50:53,023 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-02 07:50:53,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 15 [2018-12-02 07:50:53,034 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 15 treesize of output 3 [2018-12-02 07:50:53,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,043 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:82 [2018-12-02 07:50:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-12-02 07:50:53,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:50:53,160 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-02 07:50:53,162 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-02 07:50:53,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:1 [2018-12-02 07:50:53,210 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-02 07:50:53,216 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-02 07:50:53,217 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-02 07:50:53,224 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-02 07:50:53,243 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-02 07:50:53,249 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-02 07:50:53,250 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-02 07:50:53,257 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-02 07:50:53,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:53,275 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:53,276 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 122 treesize of output 104 [2018-12-02 07:50:53,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:53,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 81 [2018-12-02 07:50:53,280 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-12-02 07:50:53,295 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 51 treesize of output 38 [2018-12-02 07:50:53,295 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,299 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,304 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:53,310 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 122 treesize of output 121 [2018-12-02 07:50:53,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:53,314 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 111 treesize of output 106 [2018-12-02 07:50:53,315 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:53,324 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-12-02 07:50:53,326 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 51 treesize of output 38 [2018-12-02 07:50:53,326 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,331 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,335 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-02 07:50:53,349 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 54 treesize of output 24 [2018-12-02 07:50:53,350 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-02 07:50:53,350 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,353 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 46 [2018-12-02 07:50:53,357 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-02 07:50:53,357 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,358 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:53,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 07:50:53,365 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:151, output treesize:48 [2018-12-02 07:50:53,411 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-02 07:50:53,413 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-02 07:50:53,427 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-02 07:50:53,430 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-02 07:50:53,433 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-02 07:50:53,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:20 [2018-12-02 07:50:53,931 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-02 07:50:53,933 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-02 07:50:53,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 07:50:53,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-12-02 07:50:54,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:54,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:54,424 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-02 07:50:54,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2018-12-02 07:50:54,430 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-02 07:50:54,433 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-02 07:50:54,437 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-02 07:50:54,439 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-02 07:50:54,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 07:50:54,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:30 [2018-12-02 07:50:54,930 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-02 07:50:54,932 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-02 07:50:54,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 07:50:54,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-12-02 07:50:55,433 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-02 07:50:55,435 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-02 07:50:55,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 07:50:55,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-12-02 07:50:55,938 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-02 07:50:55,942 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-02 07:50:55,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:55,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:55,954 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-02 07:50:55,956 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-02 07:50:55,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 07:50:55,957 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:81, output treesize:30 [2018-12-02 07:50:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 47 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-02 07:50:56,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:50:56,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16, 8] total 27 [2018-12-02 07:50:56,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:50:56,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:50:56,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:50:56,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=622, Unknown=1, NotChecked=0, Total=702 [2018-12-02 07:50:56,065 INFO L87 Difference]: Start difference. First operand 2075 states and 3197 transitions. Second operand 7 states. [2018-12-02 07:50:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:50:57,193 INFO L93 Difference]: Finished difference Result 6147 states and 9483 transitions. [2018-12-02 07:50:57,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:50:57,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2018-12-02 07:50:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:50:57,199 INFO L225 Difference]: With dead ends: 6147 [2018-12-02 07:50:57,199 INFO L226 Difference]: Without dead ends: 4099 [2018-12-02 07:50:57,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 378 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=97, Invalid=714, Unknown=1, NotChecked=0, Total=812 [2018-12-02 07:50:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2018-12-02 07:50:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 2083. [2018-12-02 07:50:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2018-12-02 07:50:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3205 transitions. [2018-12-02 07:50:57,370 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3205 transitions. Word has length 195 [2018-12-02 07:50:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:50:57,370 INFO L480 AbstractCegarLoop]: Abstraction has 2083 states and 3205 transitions. [2018-12-02 07:50:57,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:50:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3205 transitions. [2018-12-02 07:50:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-02 07:50:57,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:50:57,372 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] [2018-12-02 07:50:57,372 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:50:57,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1019606890, now seen corresponding path program 1 times [2018-12-02 07:50:57,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:50:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:57,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:50:57,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:50:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:57,639 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-02 07:50:57,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:50:57,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:50:57,640 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-12-02 07:50:57,640 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], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:50:57,642 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:50:57,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:50:57,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:50:57,826 INFO L272 AbstractInterpreter]: Visited 83 different actions 219 times. Merged at 66 different actions 126 times. Never widened. Performed 1623 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1623 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 8 different actions. Largest state had 138 variables. [2018-12-02 07:50:57,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:50:57,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:50:57,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:50:57,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/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-02 07:50:57,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:50:57,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:50:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:50:57,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:50:57,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:57,949 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-02 07:50:57,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:57,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:57,961 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-02 07:50:57,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:57,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:57,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:57,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:57,979 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-02 07:50:57,979 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:57,987 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:57,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,004 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-02 07:50:58,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, 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-02 07:50:58,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,007 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-02 07:50:58,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,012 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-02 07:50:58,012 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,018 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,027 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,038 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-02 07:50:58,038 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 07:50:58,066 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-02 07:50:58,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,076 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-02 07:50:58,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,106 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-02 07:50:58,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,114 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-02 07:50:58,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,138 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-02 07:50:58,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 07:50:58,145 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,158 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,165 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 07:50:58,184 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-02 07:50:58,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,192 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-02 07:50:58,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:50:58,217 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-02 07:50:58,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,225 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-02 07:50:58,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:50:58,246 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-02 07:50:58,248 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-02 07:50:58,261 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-02 07:50:58,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,269 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-02 07:50:58,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,282 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-02 07:50:58,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,298 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,311 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:50:58,316 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-02 07:50:58,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,322 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-02 07:50:58,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:50:58,343 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-02 07:50:58,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,350 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-02 07:50:58,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:50:58,370 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-02 07:50:58,372 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-02 07:50:58,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 103 treesize of output 82 [2018-12-02 07:50:58,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 07:50:58,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,406 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-02 07:50:58,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,425 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,441 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:50:58,445 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-02 07:50:58,446 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-02 07:50:58,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-02 07:50:58,448 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-02 07:50:58,460 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-02 07:50:58,462 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-02 07:50:58,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 07:50:58,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-02 07:50:58,477 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-02 07:50:58,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 07:50:58,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,500 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-02 07:50:58,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,512 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-02 07:50:58,512 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,542 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:50:58,546 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-02 07:50:58,547 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-02 07:50:58,548 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-02 07:50:58,550 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-02 07:50:58,561 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-02 07:50:58,563 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-02 07:50:58,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 07:50:58,589 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-02 07:50:58,593 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-02 07:50:58,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,620 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-02 07:50:58,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 22 treesize of output 21 [2018-12-02 07:50:58,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,648 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-02 07:50:58,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,654 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-02 07:50:58,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,669 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,679 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-02 07:50:58,689 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-02 07:50:58,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,747 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 120 treesize of output 121 [2018-12-02 07:50:58,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 07:50:58,750 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,760 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,793 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-02 07:50:58,801 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-02 07:50:58,831 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-02 07:50:58,836 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-02 07:50:58,868 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-02 07:50:58,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,895 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-02 07:50:58,895 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,927 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-02 07:50:58,929 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-02 07:50:58,929 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,951 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-02 07:50:58,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:58,966 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-02 07:50:58,967 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:58,991 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,003 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-02 07:50:59,015 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-02 07:50:59,034 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-02 07:50:59,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:59,038 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-02 07:50:59,038 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,042 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,058 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-02 07:50:59,084 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-02 07:50:59,086 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-02 07:50:59,087 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-02 07:50:59,091 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-02 07:50:59,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:59,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 82 [2018-12-02 07:50:59,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:59,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:59,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:59,112 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 57 treesize of output 87 [2018-12-02 07:50:59,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,130 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 115 treesize of output 93 [2018-12-02 07:50:59,132 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 93 treesize of output 73 [2018-12-02 07:50:59,133 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-02 07:50:59,140 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-02 07:50:59,144 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-02 07:50:59,144 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-02 07:50:59,346 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-02 07:50:59,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:50:59,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:59,421 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 229 treesize of output 218 [2018-12-02 07:50:59,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:50:59,428 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 208 treesize of output 191 [2018-12-02 07:50:59,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,463 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-02 07:50:59,467 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-02 07:50:59,487 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-02 07:50:59,497 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-02 07:50:59,510 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-02 07:50:59,512 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-02 07:50:59,521 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-02 07:50:59,524 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-02 07:50:59,531 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-02 07:50:59,535 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-02 07:50:59,536 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-02 07:50:59,538 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-02 07:50:59,546 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-02 07:50:59,548 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-02 07:50:59,549 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,556 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-02 07:50:59,569 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,569 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,570 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-02 07:50:59,570 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,583 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-02 07:50:59,584 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-02 07:50:59,584 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,590 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,590 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,591 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-02 07:50:59,591 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,595 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,603 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-02 07:50:59,605 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 107 treesize of output 99 [2018-12-02 07:50:59,605 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,617 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,617 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,618 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 99 treesize of output 90 [2018-12-02 07:50:59,618 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,628 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,628 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,629 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,629 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,629 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,630 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:50:59,630 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-02 07:50:59,630 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 07:50:59,638 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:50:59,645 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-02 07:50:59,650 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-02 07:50:59,660 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-02 07:50:59,660 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:109 [2018-12-02 07:50:59,667 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-02 07:50:59,669 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-02 07:50:59,671 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-02 07:50:59,672 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-02 07:50:59,672 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-02 07:50:59,674 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-02 07:50:59,676 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-02 07:50:59,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-02 07:50:59,685 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-02 07:50:59,686 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-02 07:50:59,693 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-02 07:50:59,694 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-02 07:50:59,695 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-02 07:50:59,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-02 07:50:59,698 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-02 07:50:59,700 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-02 07:50:59,702 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-02 07:50:59,703 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-02 07:50:59,703 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-02 07:50:59,705 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-02 07:50:59,706 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-02 07:50:59,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-02 07:50:59,716 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-02 07:50:59,718 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-02 07:50:59,722 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-02 07:50:59,724 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-02 07:50:59,725 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-02 07:50:59,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 07:50:59,729 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-02 07:50:59,731 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-02 07:50:59,732 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-02 07:50:59,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 07:50:59,736 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-02 07:50:59,738 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-02 07:50:59,739 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-02 07:50:59,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 07:50:59,744 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-02 07:50:59,745 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-02 07:50:59,755 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-02 07:50:59,757 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-02 07:50:59,758 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-02 07:50:59,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 07:50:59,761 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-02 07:50:59,763 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-02 07:50:59,764 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-02 07:50:59,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 07:50:59,768 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-02 07:50:59,770 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-02 07:50:59,771 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-02 07:50:59,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 07:50:59,775 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-02 07:50:59,777 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-02 07:50:59,784 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-02 07:50:59,785 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-02 07:50:59,793 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-02 07:50:59,795 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-02 07:50:59,796 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-02 07:50:59,796 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:20 [2018-12-02 07:50:59,849 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-02 07:50:59,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:50:59,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2018-12-02 07:50:59,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:50:59,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 07:50:59,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 07:50:59,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-02 07:50:59,866 INFO L87 Difference]: Start difference. First operand 2083 states and 3205 transitions. Second operand 14 states. [2018-12-02 07:51:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:03,501 INFO L93 Difference]: Finished difference Result 6876 states and 10458 transitions. [2018-12-02 07:51:03,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 07:51:03,502 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 195 [2018-12-02 07:51:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:03,506 INFO L225 Difference]: With dead ends: 6876 [2018-12-02 07:51:03,506 INFO L226 Difference]: Without dead ends: 4820 [2018-12-02 07:51:03,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 371 SyntacticMatches, 22 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-12-02 07:51:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2018-12-02 07:51:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 2683. [2018-12-02 07:51:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2018-12-02 07:51:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4205 transitions. [2018-12-02 07:51:03,707 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4205 transitions. Word has length 195 [2018-12-02 07:51:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:03,707 INFO L480 AbstractCegarLoop]: Abstraction has 2683 states and 4205 transitions. [2018-12-02 07:51:03,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 07:51:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4205 transitions. [2018-12-02 07:51:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-02 07:51:03,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:03,709 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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] [2018-12-02 07:51:03,710 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:03,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:03,710 INFO L82 PathProgramCache]: Analyzing trace with hash 862439301, now seen corresponding path program 1 times [2018-12-02 07:51:03,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:03,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:03,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 07:51:03,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:03,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:51:03,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:03,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:51:03,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:51:03,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:51:03,772 INFO L87 Difference]: Start difference. First operand 2683 states and 4205 transitions. Second operand 4 states. [2018-12-02 07:51:04,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:04,249 INFO L93 Difference]: Finished difference Result 5444 states and 8519 transitions. [2018-12-02 07:51:04,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:04,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-12-02 07:51:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:04,253 INFO L225 Difference]: With dead ends: 5444 [2018-12-02 07:51:04,253 INFO L226 Difference]: Without dead ends: 2788 [2018-12-02 07:51:04,255 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-02 07:51:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2018-12-02 07:51:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2683. [2018-12-02 07:51:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2018-12-02 07:51:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4201 transitions. [2018-12-02 07:51:04,436 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4201 transitions. Word has length 203 [2018-12-02 07:51:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:04,436 INFO L480 AbstractCegarLoop]: Abstraction has 2683 states and 4201 transitions. [2018-12-02 07:51:04,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:51:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4201 transitions. [2018-12-02 07:51:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-02 07:51:04,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:04,438 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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] [2018-12-02 07:51:04,438 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:04,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash -339942442, now seen corresponding path program 1 times [2018-12-02 07:51:04,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:04,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:04,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:04,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:04,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 07:51:04,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:04,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:51:04,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:04,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:51:04,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:51:04,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:51:04,487 INFO L87 Difference]: Start difference. First operand 2683 states and 4201 transitions. Second operand 4 states. [2018-12-02 07:51:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:04,941 INFO L93 Difference]: Finished difference Result 5436 states and 8503 transitions. [2018-12-02 07:51:04,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:04,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2018-12-02 07:51:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:04,944 INFO L225 Difference]: With dead ends: 5436 [2018-12-02 07:51:04,944 INFO L226 Difference]: Without dead ends: 2780 [2018-12-02 07:51:04,946 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-02 07:51:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2018-12-02 07:51:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2683. [2018-12-02 07:51:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2018-12-02 07:51:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4197 transitions. [2018-12-02 07:51:05,122 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4197 transitions. Word has length 204 [2018-12-02 07:51:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:05,123 INFO L480 AbstractCegarLoop]: Abstraction has 2683 states and 4197 transitions. [2018-12-02 07:51:05,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:51:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4197 transitions. [2018-12-02 07:51:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-02 07:51:05,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:05,124 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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-02 07:51:05,124 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:05,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:05,124 INFO L82 PathProgramCache]: Analyzing trace with hash -67549126, now seen corresponding path program 1 times [2018-12-02 07:51:05,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:05,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:05,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:05,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:05,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-02 07:51:05,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:05,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:51:05,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:05,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:51:05,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:51:05,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:51:05,206 INFO L87 Difference]: Start difference. First operand 2683 states and 4197 transitions. Second operand 6 states. [2018-12-02 07:51:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:06,096 INFO L93 Difference]: Finished difference Result 6222 states and 9689 transitions. [2018-12-02 07:51:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:51:06,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2018-12-02 07:51:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:06,099 INFO L225 Difference]: With dead ends: 6222 [2018-12-02 07:51:06,100 INFO L226 Difference]: Without dead ends: 3566 [2018-12-02 07:51:06,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:51:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2018-12-02 07:51:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 2479. [2018-12-02 07:51:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2018-12-02 07:51:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3869 transitions. [2018-12-02 07:51:06,264 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3869 transitions. Word has length 208 [2018-12-02 07:51:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:06,264 INFO L480 AbstractCegarLoop]: Abstraction has 2479 states and 3869 transitions. [2018-12-02 07:51:06,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:51:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3869 transitions. [2018-12-02 07:51:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-02 07:51:06,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:06,265 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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-02 07:51:06,265 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:06,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash 895187393, now seen corresponding path program 1 times [2018-12-02 07:51:06,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:06,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:06,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-02 07:51:06,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:06,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:51:06,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:06,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:51:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:51:06,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:51:06,367 INFO L87 Difference]: Start difference. First operand 2479 states and 3869 transitions. Second operand 6 states. [2018-12-02 07:51:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:07,272 INFO L93 Difference]: Finished difference Result 5498 states and 8521 transitions. [2018-12-02 07:51:07,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:51:07,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2018-12-02 07:51:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:07,275 INFO L225 Difference]: With dead ends: 5498 [2018-12-02 07:51:07,275 INFO L226 Difference]: Without dead ends: 3046 [2018-12-02 07:51:07,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:51:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2018-12-02 07:51:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 2483. [2018-12-02 07:51:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2483 states. [2018-12-02 07:51:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3865 transitions. [2018-12-02 07:51:07,450 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3865 transitions. Word has length 209 [2018-12-02 07:51:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:07,451 INFO L480 AbstractCegarLoop]: Abstraction has 2483 states and 3865 transitions. [2018-12-02 07:51:07,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:51:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3865 transitions. [2018-12-02 07:51:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-02 07:51:07,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:07,452 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:07,452 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:07,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:07,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1056430011, now seen corresponding path program 1 times [2018-12-02 07:51:07,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:07,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:07,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:07,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:07,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 07:51:07,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:07,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:51:07,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:07,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:51:07,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:51:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:51:07,546 INFO L87 Difference]: Start difference. First operand 2483 states and 3865 transitions. Second operand 5 states. [2018-12-02 07:51:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:08,075 INFO L93 Difference]: Finished difference Result 5464 states and 8506 transitions. [2018-12-02 07:51:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:08,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2018-12-02 07:51:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:08,078 INFO L225 Difference]: With dead ends: 5464 [2018-12-02 07:51:08,078 INFO L226 Difference]: Without dead ends: 3008 [2018-12-02 07:51:08,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:51:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2018-12-02 07:51:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2631. [2018-12-02 07:51:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2018-12-02 07:51:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 4125 transitions. [2018-12-02 07:51:08,245 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 4125 transitions. Word has length 215 [2018-12-02 07:51:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:08,245 INFO L480 AbstractCegarLoop]: Abstraction has 2631 states and 4125 transitions. [2018-12-02 07:51:08,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:51:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 4125 transitions. [2018-12-02 07:51:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-02 07:51:08,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:08,246 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:08,247 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:08,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:08,247 INFO L82 PathProgramCache]: Analyzing trace with hash -458841397, now seen corresponding path program 1 times [2018-12-02 07:51:08,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:08,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:08,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:08,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:08,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 07:51:08,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:08,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:51:08,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:08,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:51:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:51:08,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:51:08,352 INFO L87 Difference]: Start difference. First operand 2631 states and 4125 transitions. Second operand 5 states. [2018-12-02 07:51:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:08,895 INFO L93 Difference]: Finished difference Result 5600 states and 8742 transitions. [2018-12-02 07:51:08,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:08,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2018-12-02 07:51:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:08,898 INFO L225 Difference]: With dead ends: 5600 [2018-12-02 07:51:08,898 INFO L226 Difference]: Without dead ends: 2996 [2018-12-02 07:51:08,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:51:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2018-12-02 07:51:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2623. [2018-12-02 07:51:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2623 states. [2018-12-02 07:51:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 4109 transitions. [2018-12-02 07:51:09,066 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 4109 transitions. Word has length 216 [2018-12-02 07:51:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:09,066 INFO L480 AbstractCegarLoop]: Abstraction has 2623 states and 4109 transitions. [2018-12-02 07:51:09,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:51:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 4109 transitions. [2018-12-02 07:51:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-02 07:51:09,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:09,068 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:09,068 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:09,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:09,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1538163606, now seen corresponding path program 1 times [2018-12-02 07:51:09,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:09,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:09,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:09,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:09,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-02 07:51:09,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:09,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:51:09,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:09,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:51:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:51:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:51:09,120 INFO L87 Difference]: Start difference. First operand 2623 states and 4109 transitions. Second operand 4 states. [2018-12-02 07:51:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:09,542 INFO L93 Difference]: Finished difference Result 5312 states and 8315 transitions. [2018-12-02 07:51:09,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:09,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-12-02 07:51:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:09,545 INFO L225 Difference]: With dead ends: 5312 [2018-12-02 07:51:09,545 INFO L226 Difference]: Without dead ends: 2716 [2018-12-02 07:51:09,546 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-02 07:51:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-12-02 07:51:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2623. [2018-12-02 07:51:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2623 states. [2018-12-02 07:51:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 4105 transitions. [2018-12-02 07:51:09,710 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 4105 transitions. Word has length 219 [2018-12-02 07:51:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:09,710 INFO L480 AbstractCegarLoop]: Abstraction has 2623 states and 4105 transitions. [2018-12-02 07:51:09,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:51:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 4105 transitions. [2018-12-02 07:51:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-02 07:51:09,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:09,712 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:09,712 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:09,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1268047661, now seen corresponding path program 1 times [2018-12-02 07:51:09,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:09,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:09,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-12-02 07:51:09,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:51:09,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:51:09,787 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-12-02 07:51:09,787 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [52], [54], [59], [64], [69], [72], [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], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:51:09,789 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:51:09,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:51:10,092 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:51:10,092 INFO L272 AbstractInterpreter]: Visited 95 different actions 322 times. Merged at 76 different actions 205 times. Never widened. Performed 2571 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 15 different actions. Largest state had 148 variables. [2018-12-02 07:51:10,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:10,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:51:10,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:51:10,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:51:10,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:10,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:51:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:10,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:51:10,213 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 20 treesize of output 16 [2018-12-02 07:51:10,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 07:51:10,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 07:51:10,243 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 82 treesize of output 74 [2018-12-02 07:51:10,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2018-12-02 07:51:10,245 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-02 07:51:10,249 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-02 07:51:10,251 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 72 treesize of output 66 [2018-12-02 07:51:10,252 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 55 treesize of output 24 [2018-12-02 07:51:10,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,257 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 84 treesize of output 78 [2018-12-02 07:51:10,258 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 65 treesize of output 53 [2018-12-02 07:51:10,259 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-02 07:51:10,264 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-02 07:51:10,292 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 58 treesize of output 48 [2018-12-02 07:51:10,293 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-02 07:51:10,293 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,301 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 43 treesize of output 68 [2018-12-02 07:51:10,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 24 [2018-12-02 07:51:10,303 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,305 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,307 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,309 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 36 treesize of output 33 [2018-12-02 07:51:10,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-12-02 07:51:10,311 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:10,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,312 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 24 treesize of output 29 [2018-12-02 07:51:10,313 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,315 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,317 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,331 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 71 [2018-12-02 07:51:10,333 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 60 treesize of output 59 [2018-12-02 07:51:10,334 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,369 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 57 treesize of output 72 [2018-12-02 07:51:10,369 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,420 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 119 [2018-12-02 07:51:10,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2018-12-02 07:51:10,426 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 62 [2018-12-02 07:51:10,450 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,460 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:10,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,491 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 3 case distinctions, treesize of input 55 treesize of output 91 [2018-12-02 07:51:10,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 62 [2018-12-02 07:51:10,496 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:10,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-12-02 07:51:10,516 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,523 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,532 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,542 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 27 treesize of output 23 [2018-12-02 07:51:10,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-12-02 07:51:10,544 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,545 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,545 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 22 treesize of output 20 [2018-12-02 07:51:10,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-12-02 07:51:10,547 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,548 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:10,551 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 07:51:10,561 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 19 treesize of output 15 [2018-12-02 07:51:10,562 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 15 treesize of output 3 [2018-12-02 07:51:10,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,566 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 19 treesize of output 15 [2018-12-02 07:51:10,567 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 15 treesize of output 3 [2018-12-02 07:51:10,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:10,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-02 07:51:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 276 proven. 17 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-12-02 07:51:10,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:51:10,601 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:10,601 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-02 07:51:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-12-02 07:51:10,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:51:10,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 12 [2018-12-02 07:51:10,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:10,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:51:10,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:51:10,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 07:51:10,644 INFO L87 Difference]: Start difference. First operand 2623 states and 4105 transitions. Second operand 4 states. [2018-12-02 07:51:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:11,170 INFO L93 Difference]: Finished difference Result 5744 states and 8978 transitions. [2018-12-02 07:51:11,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:11,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-12-02 07:51:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:11,174 INFO L225 Difference]: With dead ends: 5744 [2018-12-02 07:51:11,174 INFO L226 Difference]: Without dead ends: 3148 [2018-12-02 07:51:11,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:51:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2018-12-02 07:51:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 2687. [2018-12-02 07:51:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2018-12-02 07:51:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4191 transitions. [2018-12-02 07:51:11,355 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4191 transitions. Word has length 223 [2018-12-02 07:51:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:11,356 INFO L480 AbstractCegarLoop]: Abstraction has 2687 states and 4191 transitions. [2018-12-02 07:51:11,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:51:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4191 transitions. [2018-12-02 07:51:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-02 07:51:11,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:11,357 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:11,357 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:11,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:11,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1960528824, now seen corresponding path program 1 times [2018-12-02 07:51:11,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:11,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:11,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:11,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:11,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 312 proven. 5 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-02 07:51:11,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:51:11,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:51:11,440 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-12-02 07:51:11,441 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [52], [54], [59], [64], [69], [74], [77], [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], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:51:11,442 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:51:11,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:51:11,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:51:11,762 INFO L272 AbstractInterpreter]: Visited 95 different actions 324 times. Merged at 73 different actions 207 times. Never widened. Performed 2913 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2913 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 15 different actions. Largest state had 148 variables. [2018-12-02 07:51:11,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:11,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:51:11,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:51:11,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:51:11,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:11,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:51:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:11,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:51:11,869 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 20 treesize of output 16 [2018-12-02 07:51:11,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 07:51:11,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:11,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:11,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:11,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 07:51:11,902 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 84 treesize of output 78 [2018-12-02 07:51:11,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2018-12-02 07:51:11,904 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-02 07:51:11,909 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-02 07:51:11,910 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 82 treesize of output 78 [2018-12-02 07:51:11,912 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 67 treesize of output 59 [2018-12-02 07:51:11,912 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-02 07:51:11,916 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-02 07:51:11,918 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 72 treesize of output 68 [2018-12-02 07:51:11,919 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 59 treesize of output 45 [2018-12-02 07:51:11,919 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:11,923 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:11,944 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 70 treesize of output 62 [2018-12-02 07:51:11,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-12-02 07:51:11,947 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-02 07:51:11,951 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-02 07:51:11,952 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 66 treesize of output 60 [2018-12-02 07:51:11,954 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 53 treesize of output 41 [2018-12-02 07:51:11,954 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-02 07:51:11,958 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-02 07:51:11,959 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 55 treesize of output 49 [2018-12-02 07:51:11,960 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 49 treesize of output 13 [2018-12-02 07:51:11,961 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:11,962 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:11,989 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 46 treesize of output 36 [2018-12-02 07:51:11,991 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-02 07:51:11,991 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:11,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:11,998 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 31 treesize of output 44 [2018-12-02 07:51:12,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-12-02 07:51:12,001 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,003 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,005 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-02 07:51:12,019 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2018-12-02 07:51:12,021 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 42 treesize of output 41 [2018-12-02 07:51:12,021 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,049 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 39 treesize of output 48 [2018-12-02 07:51:12,050 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,089 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 77 [2018-12-02 07:51:12,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-12-02 07:51:12,095 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2018-12-02 07:51:12,118 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,130 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:12,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,175 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 3 case distinctions, treesize of input 37 treesize of output 61 [2018-12-02 07:51:12,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2018-12-02 07:51:12,178 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:12,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-12-02 07:51:12,197 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,205 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:12,211 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,213 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-02 07:51:12,213 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-02 07:51:12,214 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,215 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:12,221 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 07:51:12,229 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 19 treesize of output 15 [2018-12-02 07:51:12,230 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 15 treesize of output 3 [2018-12-02 07:51:12,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,235 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 19 treesize of output 15 [2018-12-02 07:51:12,236 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 15 treesize of output 3 [2018-12-02 07:51:12,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:12,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-02 07:51:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 283 proven. 13 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-12-02 07:51:12,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:51:12,270 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:12,271 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-02 07:51:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-12-02 07:51:12,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:51:12,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 12 [2018-12-02 07:51:12,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:12,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:51:12,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:51:12,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 07:51:12,302 INFO L87 Difference]: Start difference. First operand 2687 states and 4191 transitions. Second operand 4 states. [2018-12-02 07:51:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:12,836 INFO L93 Difference]: Finished difference Result 5712 states and 8874 transitions. [2018-12-02 07:51:12,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:12,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-12-02 07:51:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:12,839 INFO L225 Difference]: With dead ends: 5712 [2018-12-02 07:51:12,839 INFO L226 Difference]: Without dead ends: 3052 [2018-12-02 07:51:12,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 445 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:51:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2018-12-02 07:51:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2687. [2018-12-02 07:51:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2018-12-02 07:51:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4173 transitions. [2018-12-02 07:51:13,014 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4173 transitions. Word has length 224 [2018-12-02 07:51:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:13,014 INFO L480 AbstractCegarLoop]: Abstraction has 2687 states and 4173 transitions. [2018-12-02 07:51:13,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:51:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4173 transitions. [2018-12-02 07:51:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-02 07:51:13,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:13,016 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:13,016 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:13,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash 570225439, now seen corresponding path program 1 times [2018-12-02 07:51:13,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:13,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:13,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-02 07:51:13,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:13,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:51:13,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:13,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:51:13,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:51:13,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:51:13,082 INFO L87 Difference]: Start difference. First operand 2687 states and 4173 transitions. Second operand 4 states. [2018-12-02 07:51:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:13,516 INFO L93 Difference]: Finished difference Result 5477 states and 8474 transitions. [2018-12-02 07:51:13,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:13,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-12-02 07:51:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:13,518 INFO L225 Difference]: With dead ends: 5477 [2018-12-02 07:51:13,518 INFO L226 Difference]: Without dead ends: 2817 [2018-12-02 07:51:13,520 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-02 07:51:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2018-12-02 07:51:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2730. [2018-12-02 07:51:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2018-12-02 07:51:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 4224 transitions. [2018-12-02 07:51:13,692 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 4224 transitions. Word has length 224 [2018-12-02 07:51:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:13,692 INFO L480 AbstractCegarLoop]: Abstraction has 2730 states and 4224 transitions. [2018-12-02 07:51:13,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:51:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 4224 transitions. [2018-12-02 07:51:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-02 07:51:13,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:13,693 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 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-02 07:51:13,694 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:13,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:13,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1052584702, now seen corresponding path program 1 times [2018-12-02 07:51:13,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:13,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:13,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:13,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:13,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 07:51:13,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:13,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:51:13,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:13,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:51:13,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:51:13,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:51:13,770 INFO L87 Difference]: Start difference. First operand 2730 states and 4224 transitions. Second operand 5 states. [2018-12-02 07:51:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:14,388 INFO L93 Difference]: Finished difference Result 5810 states and 8952 transitions. [2018-12-02 07:51:14,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:14,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2018-12-02 07:51:14,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:14,392 INFO L225 Difference]: With dead ends: 5810 [2018-12-02 07:51:14,392 INFO L226 Difference]: Without dead ends: 3107 [2018-12-02 07:51:14,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:51:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2018-12-02 07:51:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 2726. [2018-12-02 07:51:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-12-02 07:51:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 4220 transitions. [2018-12-02 07:51:14,569 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 4220 transitions. Word has length 225 [2018-12-02 07:51:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:14,569 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 4220 transitions. [2018-12-02 07:51:14,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:51:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 4220 transitions. [2018-12-02 07:51:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-02 07:51:14,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:14,571 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:14,571 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:14,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash -517719115, now seen corresponding path program 1 times [2018-12-02 07:51:14,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:14,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:14,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:14,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:14,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-02 07:51:14,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:14,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:51:14,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:14,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:51:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:51:14,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:51:14,643 INFO L87 Difference]: Start difference. First operand 2726 states and 4220 transitions. Second operand 4 states. [2018-12-02 07:51:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:15,047 INFO L93 Difference]: Finished difference Result 5526 states and 8533 transitions. [2018-12-02 07:51:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:15,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2018-12-02 07:51:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:15,050 INFO L225 Difference]: With dead ends: 5526 [2018-12-02 07:51:15,050 INFO L226 Difference]: Without dead ends: 2819 [2018-12-02 07:51:15,052 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-02 07:51:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2018-12-02 07:51:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2750. [2018-12-02 07:51:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2018-12-02 07:51:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 4248 transitions. [2018-12-02 07:51:15,224 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 4248 transitions. Word has length 225 [2018-12-02 07:51:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:15,224 INFO L480 AbstractCegarLoop]: Abstraction has 2750 states and 4248 transitions. [2018-12-02 07:51:15,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:51:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 4248 transitions. [2018-12-02 07:51:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-02 07:51:15,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:15,226 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 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-02 07:51:15,227 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:15,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:15,227 INFO L82 PathProgramCache]: Analyzing trace with hash 714774066, now seen corresponding path program 1 times [2018-12-02 07:51:15,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:15,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:15,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:15,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:15,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 07:51:15,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:15,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:51:15,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:15,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:51:15,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:51:15,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:51:15,315 INFO L87 Difference]: Start difference. First operand 2750 states and 4248 transitions. Second operand 5 states. [2018-12-02 07:51:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:15,871 INFO L93 Difference]: Finished difference Result 5831 states and 8978 transitions. [2018-12-02 07:51:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:15,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 226 [2018-12-02 07:51:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:15,874 INFO L225 Difference]: With dead ends: 5831 [2018-12-02 07:51:15,874 INFO L226 Difference]: Without dead ends: 3100 [2018-12-02 07:51:15,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:51:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-02 07:51:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2731. [2018-12-02 07:51:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2018-12-02 07:51:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 4227 transitions. [2018-12-02 07:51:16,050 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 4227 transitions. Word has length 226 [2018-12-02 07:51:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:16,050 INFO L480 AbstractCegarLoop]: Abstraction has 2731 states and 4227 transitions. [2018-12-02 07:51:16,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:51:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 4227 transitions. [2018-12-02 07:51:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-02 07:51:16,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:16,052 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:16,052 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:16,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash -246919567, now seen corresponding path program 2 times [2018-12-02 07:51:16,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:16,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:16,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:16,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:16,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 59 proven. 382 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 07:51:16,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:51:16,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:51:16,538 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:51:16,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:51:16,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:51:16,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:51:16,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:51:16,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:51:17,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 07:51:17,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:51:17,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:51:17,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 19 treesize of output 16 [2018-12-02 07:51:17,263 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 16 treesize of output 1 [2018-12-02 07:51:17,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:17,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:17,306 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-02 07:51:17,309 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-02 07:51:17,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:17,345 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 72 [2018-12-02 07:51:17,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,359 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 2 case distinctions, treesize of input 52 treesize of output 73 [2018-12-02 07:51:17,359 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 07:51:17,443 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 55 treesize of output 54 [2018-12-02 07:51:17,443 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:17,555 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 3 case distinctions, treesize of input 47 treesize of output 67 [2018-12-02 07:51:17,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 113 [2018-12-02 07:51:17,570 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 07:51:17,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 07:51:17,637 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-02 07:51:17,687 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:51:17,796 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 57 treesize of output 52 [2018-12-02 07:51:17,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,801 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 30 treesize of output 73 [2018-12-02 07:51:17,801 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:17,813 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:17,897 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 3 case distinctions, treesize of input 44 treesize of output 66 [2018-12-02 07:51:17,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,902 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 49 treesize of output 68 [2018-12-02 07:51:17,903 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:17,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:17,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 07:51:17,946 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-02 07:51:17,982 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:18,021 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:51:18,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:51:18,101 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:18,104 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:18,166 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 140 [2018-12-02 07:51:18,180 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 122 [2018-12-02 07:51:18,180 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-02 07:51:18,421 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 140 treesize of output 139 [2018-12-02 07:51:18,421 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:18,615 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 139 treesize of output 127 [2018-12-02 07:51:18,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:18,619 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 106 treesize of output 110 [2018-12-02 07:51:18,619 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:18,631 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:18,776 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 135 [2018-12-02 07:51:18,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:18,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:18,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 135 [2018-12-02 07:51:18,785 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:18,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:18,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 148 [2018-12-02 07:51:18,855 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-12-02 07:51:18,913 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:18,988 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 112 treesize of output 107 [2018-12-02 07:51:18,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:18,993 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 30 treesize of output 30 [2018-12-02 07:51:18,993 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,006 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,037 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:19,044 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 183 treesize of output 131 [2018-12-02 07:51:19,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,050 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 99 treesize of output 124 [2018-12-02 07:51:19,050 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,071 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 129 treesize of output 112 [2018-12-02 07:51:19,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 146 [2018-12-02 07:51:19,082 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,096 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,108 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,114 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 165 treesize of output 117 [2018-12-02 07:51:19,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,119 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 67 treesize of output 88 [2018-12-02 07:51:19,119 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,139 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 93 treesize of output 80 [2018-12-02 07:51:19,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,143 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:19,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 115 [2018-12-02 07:51:19,147 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,154 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,163 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,232 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:19,241 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:19,242 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:19,251 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:19,251 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:19,261 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:19,262 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:19,271 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:19,396 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 92 treesize of output 81 [2018-12-02 07:51:19,398 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:19,399 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 63 treesize of output 42 [2018-12-02 07:51:19,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,402 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 24 treesize of output 18 [2018-12-02 07:51:19,402 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,406 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,411 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,416 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 149 treesize of output 107 [2018-12-02 07:51:19,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 118 [2018-12-02 07:51:19,419 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,432 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 114 treesize of output 86 [2018-12-02 07:51:19,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 167 [2018-12-02 07:51:19,438 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,447 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,454 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,457 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 116 treesize of output 78 [2018-12-02 07:51:19,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 70 [2018-12-02 07:51:19,461 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,472 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 66 treesize of output 54 [2018-12-02 07:51:19,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,475 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:19,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-12-02 07:51:19,477 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,481 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,486 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,500 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 125 [2018-12-02 07:51:19,511 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 116 [2018-12-02 07:51:19,511 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-12-02 07:51:19,576 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 112 treesize of output 111 [2018-12-02 07:51:19,577 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,645 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 111 treesize of output 102 [2018-12-02 07:51:19,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,648 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 74 treesize of output 72 [2018-12-02 07:51:19,648 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,658 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,710 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 92 treesize of output 87 [2018-12-02 07:51:19,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,713 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 30 treesize of output 45 [2018-12-02 07:51:19,713 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,721 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,724 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 128 treesize of output 99 [2018-12-02 07:51:19,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 134 [2018-12-02 07:51:19,733 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,743 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,780 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:19,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 07:51:19,823 INFO L202 ElimStorePlain]: Needed 64 recursive calls to eliminate 6 variables, input treesize:268, output treesize:245 [2018-12-02 07:51:19,908 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 100 treesize of output 95 [2018-12-02 07:51:19,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:19,911 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 46 treesize of output 40 [2018-12-02 07:51:19,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:19,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:20,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,291 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 117 treesize of output 135 [2018-12-02 07:51:20,293 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:20,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 104 [2018-12-02 07:51:20,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:20,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:20,605 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 3 case distinctions, treesize of input 81 treesize of output 99 [2018-12-02 07:51:20,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 82 treesize of output 138 [2018-12-02 07:51:20,617 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:20,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:20,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 152 [2018-12-02 07:51:20,675 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 07:51:20,722 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:51:21,073 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 118 treesize of output 109 [2018-12-02 07:51:21,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,077 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 78 treesize of output 76 [2018-12-02 07:51:21,078 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,088 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,357 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 141 treesize of output 126 [2018-12-02 07:51:21,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,361 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 104 treesize of output 108 [2018-12-02 07:51:21,361 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,374 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,613 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 3 case distinctions, treesize of input 112 treesize of output 142 [2018-12-02 07:51:21,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 116 treesize of output 180 [2018-12-02 07:51:21,619 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,683 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 115 treesize of output 177 [2018-12-02 07:51:21,683 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,720 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:21,939 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 85 treesize of output 80 [2018-12-02 07:51:21,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,943 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 24 treesize of output 18 [2018-12-02 07:51:21,943 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,950 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,952 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 104 treesize of output 91 [2018-12-02 07:51:21,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,956 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 88 treesize of output 90 [2018-12-02 07:51:21,956 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,964 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,966 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 78 treesize of output 71 [2018-12-02 07:51:21,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:21,969 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 50 treesize of output 46 [2018-12-02 07:51:21,969 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:21,975 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,141 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 110 treesize of output 101 [2018-12-02 07:51:22,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,144 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 61 treesize of output 59 [2018-12-02 07:51:22,144 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,154 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,156 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 109 treesize of output 102 [2018-12-02 07:51:22,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,159 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 61 treesize of output 57 [2018-12-02 07:51:22,160 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,170 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,304 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 91 treesize of output 86 [2018-12-02 07:51:22,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,307 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 24 treesize of output 18 [2018-12-02 07:51:22,307 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,315 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,317 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 90 treesize of output 81 [2018-12-02 07:51:22,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,320 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 69 treesize of output 67 [2018-12-02 07:51:22,320 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,327 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,429 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 99 treesize of output 88 [2018-12-02 07:51:22,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,433 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 72 treesize of output 72 [2018-12-02 07:51:22,433 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,439 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,527 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 105 treesize of output 84 [2018-12-02 07:51:22,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,530 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:22,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 121 [2018-12-02 07:51:22,536 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,548 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,614 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 89 treesize of output 84 [2018-12-02 07:51:22,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,617 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 42 treesize of output 57 [2018-12-02 07:51:22,617 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,624 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 07:51:22,670 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 12 variables, input treesize:471, output treesize:352 [2018-12-02 07:51:22,747 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 94 treesize of output 64 [2018-12-02 07:51:22,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 92 [2018-12-02 07:51:22,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-12-02 07:51:22,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2018-12-02 07:51:22,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:22,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 07:51:22,948 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 64 treesize of output 54 [2018-12-02 07:51:22,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:22,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 75 [2018-12-02 07:51:22,961 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-02 07:51:22,990 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:51:23,049 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 70 treesize of output 62 [2018-12-02 07:51:23,051 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 58 treesize of output 35 [2018-12-02 07:51:23,051 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,068 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 35 treesize of output 29 [2018-12-02 07:51:23,068 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 33 [2018-12-02 07:51:23,084 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,094 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:23,128 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 68 treesize of output 52 [2018-12-02 07:51:23,130 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 17 treesize of output 1 [2018-12-02 07:51:23,130 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 07:51:23,141 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,145 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 07:51:23,190 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:393, output treesize:148 [2018-12-02 07:51:23,255 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 78 treesize of output 69 [2018-12-02 07:51:23,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,259 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-12-02 07:51:23,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,287 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 59 treesize of output 56 [2018-12-02 07:51:23,288 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 16 treesize of output 1 [2018-12-02 07:51:23,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,309 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 52 treesize of output 47 [2018-12-02 07:51:23,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:23,312 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 25 treesize of output 19 [2018-12-02 07:51:23,312 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,319 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,331 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 33 treesize of output 30 [2018-12-02 07:51:23,332 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 16 treesize of output 1 [2018-12-02 07:51:23,333 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,335 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:23,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:23,346 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:131, output treesize:55 [2018-12-02 07:51:23,349 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-02 07:51:23,399 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-02 07:51:24,293 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 269 treesize of output 235 [2018-12-02 07:51:24,297 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-02 07:51:24,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:24,361 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 164 treesize of output 161 [2018-12-02 07:51:24,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:24,370 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 151 treesize of output 153 [2018-12-02 07:51:24,370 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:24,389 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:24,427 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-02 07:51:25,101 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 215 treesize of output 202 [2018-12-02 07:51:25,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:25,109 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 151 treesize of output 153 [2018-12-02 07:51:25,110 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:25,142 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:25,631 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 196 treesize of output 190 [2018-12-02 07:51:25,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 07:51:25,634 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:25,657 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:26,074 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-02 07:51:26,179 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-02 07:51:26,539 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-02 07:51:26,554 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-02 07:51:26,828 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-02 07:51:26,914 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-02 07:51:27,284 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 281 treesize of output 260 [2018-12-02 07:51:27,289 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 257 treesize of output 256 [2018-12-02 07:51:27,290 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:29,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:29,954 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 240 treesize of output 326 [2018-12-02 07:51:29,955 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:32,740 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 303 treesize of output 234 [2018-12-02 07:51:32,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:32,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:32,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:32,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 221 [2018-12-02 07:51:32,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:32,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:32,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:32,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:32,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:32,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:32,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 352 [2018-12-02 07:51:32,788 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:32,826 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:32,876 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:34,676 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 3 case distinctions, treesize of input 246 treesize of output 254 [2018-12-02 07:51:34,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:34,686 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 237 treesize of output 247 [2018-12-02 07:51:34,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:34,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:34,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:34,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 214 [2018-12-02 07:51:34,704 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:34,766 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,259 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,432 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,618 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 133 treesize of output 118 [2018-12-02 07:51:35,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:35,623 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 115 treesize of output 125 [2018-12-02 07:51:35,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:35,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:35,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:35,632 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 117 treesize of output 139 [2018-12-02 07:51:35,632 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,642 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,652 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 84 [2018-12-02 07:51:35,819 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-02 07:51:35,820 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,833 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 40 treesize of output 47 [2018-12-02 07:51:35,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 07:51:35,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:35,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:35,837 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-02 07:51:35,838 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,842 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,847 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,855 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:35,947 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:35,992 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:36,087 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 214 [2018-12-02 07:51:36,090 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 218 treesize of output 178 [2018-12-02 07:51:36,090 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,191 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,247 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 168 treesize of output 134 [2018-12-02 07:51:36,250 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-02 07:51:36,250 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,286 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 3 case distinctions, treesize of input 40 treesize of output 64 [2018-12-02 07:51:36,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,290 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 38 treesize of output 68 [2018-12-02 07:51:36,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 112 [2018-12-02 07:51:36,297 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,308 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2018-12-02 07:51:36,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,327 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-02 07:51:36,327 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,333 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,342 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,359 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,393 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 133 treesize of output 126 [2018-12-02 07:51:36,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-12-02 07:51:36,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2018-12-02 07:51:36,403 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,410 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,422 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:36,447 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 14 variables, input treesize:551, output treesize:133 [2018-12-02 07:51:36,574 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 94 [2018-12-02 07:51:36,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,578 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 73 treesize of output 71 [2018-12-02 07:51:36,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,627 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 84 treesize of output 103 [2018-12-02 07:51:36,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,631 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 69 treesize of output 105 [2018-12-02 07:51:36,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,669 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 105 treesize of output 99 [2018-12-02 07:51:36,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-12-02 07:51:36,671 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-02 07:51:36,683 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-02 07:51:36,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,724 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 3 case distinctions, treesize of input 87 treesize of output 111 [2018-12-02 07:51:36,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,729 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 110 treesize of output 140 [2018-12-02 07:51:36,729 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 73 treesize of output 131 [2018-12-02 07:51:36,776 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,807 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:36,841 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 84 treesize of output 75 [2018-12-02 07:51:36,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,844 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 57 treesize of output 55 [2018-12-02 07:51:36,844 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,852 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,854 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 79 treesize of output 74 [2018-12-02 07:51:36,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:36,857 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 24 treesize of output 18 [2018-12-02 07:51:36,858 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,867 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:36,891 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 71 treesize of output 67 [2018-12-02 07:51:36,893 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-02 07:51:36,893 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:36,917 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:36,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 07:51:36,940 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:209, output treesize:185 [2018-12-02 07:51:39,021 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2018-12-02 07:51:39,024 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 58 treesize of output 56 [2018-12-02 07:51:39,025 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-02 07:51:39,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,046 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 59 treesize of output 53 [2018-12-02 07:51:39,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2018-12-02 07:51:39,048 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-02 07:51:39,053 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-02 07:51:39,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 07:51:39,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:91 [2018-12-02 07:51:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 354 proven. 87 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 07:51:39,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:51:39,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2018-12-02 07:51:39,499 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-02 07:51:39,503 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-02 07:51:39,542 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-02 07:51:39,547 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-02 07:51:39,573 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-02 07:51:39,578 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-02 07:51:39,598 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-02 07:51:39,603 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-02 07:51:39,625 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-02 07:51:39,630 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-02 07:51:39,645 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 131 treesize of output 99 [2018-12-02 07:51:39,661 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 23 treesize of output 22 [2018-12-02 07:51:39,662 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,687 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:39,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 129 [2018-12-02 07:51:39,691 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 14 treesize of output 1 [2018-12-02 07:51:39,691 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,701 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 14 treesize of output 1 [2018-12-02 07:51:39,701 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,703 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:51:39,707 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2018-12-02 07:51:39,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:39,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:39,710 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 39 treesize of output 68 [2018-12-02 07:51:39,724 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:39,725 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:39,725 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:39,725 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:39,726 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:39,726 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:51:39,726 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 48 treesize of output 57 [2018-12-02 07:51:39,727 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,733 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,745 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,760 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:51:39,777 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-02 07:51:39,784 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-02 07:51:39,784 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,786 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:39,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 07:51:39,797 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:322, output treesize:206 [2018-12-02 07:51:39,845 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-02 07:51:39,847 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-02 07:51:39,853 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-02 07:51:39,856 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-02 07:51:39,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:39,858 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:93 [2018-12-02 07:51:39,956 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-02 07:51:39,960 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-02 07:51:39,969 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-02 07:51:39,971 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-02 07:51:39,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 07:51:39,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:116, output treesize:116 [2018-12-02 07:51:40,056 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-02 07:51:40,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:40,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:51:40,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:382, output treesize:1 [2018-12-02 07:51:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 325 proven. 116 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 07:51:40,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:51:40,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2018-12-02 07:51:40,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:51:40,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 07:51:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 07:51:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 07:51:40,182 INFO L87 Difference]: Start difference. First operand 2731 states and 4227 transitions. Second operand 26 states. [2018-12-02 07:51:45,410 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-12-02 07:51:48,985 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-12-02 07:51:50,087 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2018-12-02 07:51:52,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:52,975 INFO L93 Difference]: Finished difference Result 15508 states and 23434 transitions. [2018-12-02 07:51:52,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 07:51:52,976 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 237 [2018-12-02 07:51:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:52,986 INFO L225 Difference]: With dead ends: 15508 [2018-12-02 07:51:52,986 INFO L226 Difference]: Without dead ends: 12804 [2018-12-02 07:51:52,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 449 SyntacticMatches, 17 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1023, Invalid=4233, Unknown=0, NotChecked=0, Total=5256 [2018-12-02 07:51:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12804 states. [2018-12-02 07:51:53,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12804 to 6484. [2018-12-02 07:51:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6484 states. [2018-12-02 07:51:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 10363 transitions. [2018-12-02 07:51:53,480 INFO L78 Accepts]: Start accepts. Automaton has 6484 states and 10363 transitions. Word has length 237 [2018-12-02 07:51:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:53,480 INFO L480 AbstractCegarLoop]: Abstraction has 6484 states and 10363 transitions. [2018-12-02 07:51:53,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 07:51:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states and 10363 transitions. [2018-12-02 07:51:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-02 07:51:53,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:53,483 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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-02 07:51:53,484 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:53,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash 337110400, now seen corresponding path program 1 times [2018-12-02 07:51:53,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:53,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:51:53,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:53,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-12-02 07:51:53,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:53,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:51:53,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:53,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:51:53,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:51:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:51:53,548 INFO L87 Difference]: Start difference. First operand 6484 states and 10363 transitions. Second operand 4 states. [2018-12-02 07:51:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:54,220 INFO L93 Difference]: Finished difference Result 12996 states and 20765 transitions. [2018-12-02 07:51:54,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:54,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2018-12-02 07:51:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:54,225 INFO L225 Difference]: With dead ends: 12996 [2018-12-02 07:51:54,225 INFO L226 Difference]: Without dead ends: 6539 [2018-12-02 07:51:54,229 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-02 07:51:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2018-12-02 07:51:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6484. [2018-12-02 07:51:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6484 states. [2018-12-02 07:51:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 10360 transitions. [2018-12-02 07:51:54,698 INFO L78 Accepts]: Start accepts. Automaton has 6484 states and 10360 transitions. Word has length 240 [2018-12-02 07:51:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:54,698 INFO L480 AbstractCegarLoop]: Abstraction has 6484 states and 10360 transitions. [2018-12-02 07:51:54,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:51:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states and 10360 transitions. [2018-12-02 07:51:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-12-02 07:51:54,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:54,701 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:54,701 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:54,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash 68039299, now seen corresponding path program 1 times [2018-12-02 07:51:54,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:54,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:54,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-12-02 07:51:54,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:54,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:51:54,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:54,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:51:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:51:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:51:54,782 INFO L87 Difference]: Start difference. First operand 6484 states and 10360 transitions. Second operand 5 states. [2018-12-02 07:51:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:55,775 INFO L93 Difference]: Finished difference Result 14080 states and 22449 transitions. [2018-12-02 07:51:55,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:55,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 247 [2018-12-02 07:51:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:55,781 INFO L225 Difference]: With dead ends: 14080 [2018-12-02 07:51:55,781 INFO L226 Difference]: Without dead ends: 7623 [2018-12-02 07:51:55,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:51:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2018-12-02 07:51:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 6904. [2018-12-02 07:51:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2018-12-02 07:51:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 11056 transitions. [2018-12-02 07:51:56,250 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 11056 transitions. Word has length 247 [2018-12-02 07:51:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:56,250 INFO L480 AbstractCegarLoop]: Abstraction has 6904 states and 11056 transitions. [2018-12-02 07:51:56,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:51:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 11056 transitions. [2018-12-02 07:51:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-02 07:51:56,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:56,252 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:56,252 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:56,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash -224677325, now seen corresponding path program 1 times [2018-12-02 07:51:56,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:56,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:56,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-02 07:51:56,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:56,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:51:56,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:56,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:51:56,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:51:56,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:51:56,315 INFO L87 Difference]: Start difference. First operand 6904 states and 11056 transitions. Second operand 4 states. [2018-12-02 07:51:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:57,235 INFO L93 Difference]: Finished difference Result 14255 states and 22780 transitions. [2018-12-02 07:51:57,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:57,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-12-02 07:51:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:57,242 INFO L225 Difference]: With dead ends: 14255 [2018-12-02 07:51:57,242 INFO L226 Difference]: Without dead ends: 7378 [2018-12-02 07:51:57,246 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-02 07:51:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7378 states. [2018-12-02 07:51:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7378 to 6904. [2018-12-02 07:51:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2018-12-02 07:51:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 11048 transitions. [2018-12-02 07:51:57,716 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 11048 transitions. Word has length 248 [2018-12-02 07:51:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:57,716 INFO L480 AbstractCegarLoop]: Abstraction has 6904 states and 11048 transitions. [2018-12-02 07:51:57,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:51:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 11048 transitions. [2018-12-02 07:51:57,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-02 07:51:57,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:57,718 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:57,718 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:57,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:57,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2051544954, now seen corresponding path program 1 times [2018-12-02 07:51:57,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:57,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:57,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:57,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:57,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-02 07:51:57,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:51:57,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:51:57,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:51:57,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:51:57,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:51:57,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:51:57,801 INFO L87 Difference]: Start difference. First operand 6904 states and 11048 transitions. Second operand 5 states. [2018-12-02 07:51:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:51:58,814 INFO L93 Difference]: Finished difference Result 14456 states and 23033 transitions. [2018-12-02 07:51:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:51:58,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2018-12-02 07:51:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:51:58,821 INFO L225 Difference]: With dead ends: 14456 [2018-12-02 07:51:58,821 INFO L226 Difference]: Without dead ends: 7579 [2018-12-02 07:51:58,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:51:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2018-12-02 07:51:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 6872. [2018-12-02 07:51:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6872 states. [2018-12-02 07:51:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 10980 transitions. [2018-12-02 07:51:59,302 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 10980 transitions. Word has length 249 [2018-12-02 07:51:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:51:59,302 INFO L480 AbstractCegarLoop]: Abstraction has 6872 states and 10980 transitions. [2018-12-02 07:51:59,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:51:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 10980 transitions. [2018-12-02 07:51:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-12-02 07:51:59,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:51:59,305 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:51:59,305 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:51:59,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:51:59,305 INFO L82 PathProgramCache]: Analyzing trace with hash -328379941, now seen corresponding path program 1 times [2018-12-02 07:51:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:51:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:59,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:51:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:51:59,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:51:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:51:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 319 proven. 192 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-02 07:51:59,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:51:59,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:51:59,784 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-12-02 07:51:59,784 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [47], [49], [54], [59], [64], [69], [72], [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], [222], [224], [227], [231], [235], [250], [256], [266], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:51:59,786 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:51:59,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:52:00,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:52:00,026 INFO L272 AbstractInterpreter]: Visited 95 different actions 322 times. Merged at 76 different actions 205 times. Never widened. Performed 2595 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2595 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 15 different actions. Largest state had 148 variables. [2018-12-02 07:52:00,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:00,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:52:00,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:00,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:52:00,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:00,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:52:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:00,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:52:00,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,141 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-02 07:52:00,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,154 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-02 07:52:00,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,180 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-02 07:52:00,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,206 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-02 07:52:00,207 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-02 07:52:00,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,209 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-02 07:52:00,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,213 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-02 07:52:00,213 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,221 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,224 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,236 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-02 07:52:00,236 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 07:52:00,268 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-02 07:52:00,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,279 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-02 07:52:00,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,331 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-02 07:52:00,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,337 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-02 07:52:00,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,361 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-02 07:52:00,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,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-02 07:52:00,367 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,382 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 07:52:00,399 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-02 07:52:00,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,407 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-02 07:52:00,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:52:00,430 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-02 07:52:00,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,435 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-02 07:52:00,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:52:00,453 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-02 07:52:00,455 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-02 07:52:00,468 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-02 07:52:00,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,475 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-02 07:52:00,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,487 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-02 07:52:00,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,518 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:52:00,522 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-02 07:52:00,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,528 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-02 07:52:00,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:52:00,550 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-02 07:52:00,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,557 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-02 07:52:00,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:52:00,579 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-02 07:52:00,581 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-02 07:52:00,598 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-02 07:52:00,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,607 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-02 07:52:00,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,624 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-02 07:52:00,625 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,646 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,659 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:52:00,663 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-02 07:52:00,664 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-02 07:52:00,665 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-02 07:52:00,667 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-02 07:52:00,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02 07:52:00,683 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-02 07:52:00,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 07:52:00,703 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-02 07:52:00,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,711 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-02 07:52:00,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,740 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-02 07:52:00,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,746 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-02 07:52:00,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:52:00,766 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-02 07:52:00,767 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-02 07:52:00,768 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-02 07:52:00,769 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-02 07:52:00,781 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-02 07:52:00,782 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-02 07:52:00,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:00,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 07:52:00,796 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-02 07:52:00,814 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-02 07:52:00,874 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-02 07:52:00,880 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-02 07:52:00,944 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 407 treesize of output 337 [2018-12-02 07:52:00,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:00,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,005 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 282 treesize of output 369 [2018-12-02 07:52:01,005 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,090 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 321 treesize of output 290 [2018-12-02 07:52:01,093 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-02 07:52:01,094 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,148 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 286 treesize of output 250 [2018-12-02 07:52:01,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,180 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 247 treesize of output 347 [2018-12-02 07:52:01,181 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,232 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,261 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,335 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 181 [2018-12-02 07:52:01,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 07:52:01,338 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,347 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,376 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-02 07:52:01,379 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-02 07:52:01,379 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,390 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 79 treesize of output 55 [2018-12-02 07:52:01,392 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-02 07:52:01,392 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,405 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-12-02 07:52:01,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,409 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-02 07:52:01,409 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,416 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,421 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-02 07:52:01,426 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-02 07:52:01,445 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-02 07:52:01,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,449 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-02 07:52:01,449 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,454 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,467 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-02 07:52:01,496 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-02 07:52:01,497 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-02 07:52:01,498 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-02 07:52:01,503 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-02 07:52:01,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 82 [2018-12-02 07:52:01,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,523 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 57 treesize of output 87 [2018-12-02 07:52:01,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,542 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 115 treesize of output 93 [2018-12-02 07:52:01,544 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 93 treesize of output 73 [2018-12-02 07:52:01,545 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-02 07:52:01,550 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-02 07:52:01,556 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-02 07:52:01,556 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-02 07:52:01,576 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 43 treesize of output 37 [2018-12-02 07:52:01,577 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 19 treesize of output 7 [2018-12-02 07:52:01,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,584 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-02 07:52:01,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,596 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-02 07:52:01,596 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2018-12-02 07:52:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 07:52:01,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:52:01,832 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-02 07:52:01,837 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-02 07:52:01,866 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-02 07:52:01,885 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-02 07:52:01,911 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-02 07:52:01,916 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-02 07:52:01,934 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-02 07:52:01,937 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-02 07:52:01,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,956 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-02 07:52:01,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:01,961 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-02 07:52:01,962 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,968 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,977 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 198 treesize of output 170 [2018-12-02 07:52:01,979 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-02 07:52:01,979 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:01,988 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 169 treesize of output 140 [2018-12-02 07:52:02,001 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,001 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,002 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-02 07:52:02,002 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:02,017 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 193 treesize of output 179 [2018-12-02 07:52:02,019 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,019 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,019 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-02 07:52:02,019 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:02,028 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 19 treesize of output 1 [2018-12-02 07:52:02,028 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:02,029 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:02,037 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 143 treesize of output 134 [2018-12-02 07:52:02,039 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,039 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,039 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 129 treesize of output 120 [2018-12-02 07:52:02,040 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:02,054 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,055 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,055 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,056 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,056 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,056 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:02,057 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 52 treesize of output 60 [2018-12-02 07:52:02,057 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:02,068 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 113 treesize of output 94 [2018-12-02 07:52:02,068 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:02,077 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:02,085 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-02 07:52:02,091 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:02,101 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 47 [2018-12-02 07:52:02,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 16 [2018-12-02 07:52:02,108 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:02,110 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:02,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:02,112 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:15 [2018-12-02 07:52:02,127 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 50 treesize of output 46 [2018-12-02 07:52:02,128 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 46 treesize of output 38 [2018-12-02 07:52:02,129 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-02 07:52:02,130 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-02 07:52:02,134 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-02 07:52:02,136 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-02 07:52:02,137 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-02 07:52:02,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 07:52:02,162 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-02 07:52:02,165 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-02 07:52:02,173 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-02 07:52:02,174 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-02 07:52:02,175 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-02 07:52:02,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 07:52:02,190 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-02 07:52:02,192 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-02 07:52:02,195 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-02 07:52:02,196 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-02 07:52:02,197 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-02 07:52:02,198 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-02 07:52:02,200 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-02 07:52:02,200 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 07:52:02,225 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-02 07:52:02,227 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-02 07:52:02,234 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-02 07:52:02,235 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-02 07:52:02,237 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-02 07:52:02,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 07:52:02,261 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-02 07:52:02,262 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-02 07:52:02,263 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-02 07:52:02,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 07:52:02,280 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-02 07:52:02,281 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-02 07:52:02,282 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-02 07:52:02,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 07:52:02,298 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-02 07:52:02,300 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-02 07:52:02,310 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-02 07:52:02,312 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-02 07:52:02,313 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-02 07:52:02,313 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 07:52:02,329 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-02 07:52:02,330 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-02 07:52:02,331 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-02 07:52:02,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 07:52:02,350 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-02 07:52:02,351 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-02 07:52:02,352 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-02 07:52:02,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 07:52:02,369 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-02 07:52:02,370 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-02 07:52:02,376 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-02 07:52:02,378 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-02 07:52:02,386 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-02 07:52:02,387 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-02 07:52:02,388 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-02 07:52:02,389 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:20 [2018-12-02 07:52:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 319 proven. 124 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 07:52:02,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:52:02,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-02 07:52:02,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:52:02,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 07:52:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 07:52:02,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-12-02 07:52:02,535 INFO L87 Difference]: Start difference. First operand 6872 states and 10980 transitions. Second operand 16 states. [2018-12-02 07:52:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:06,394 INFO L93 Difference]: Finished difference Result 18254 states and 28686 transitions. [2018-12-02 07:52:06,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 07:52:06,395 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 251 [2018-12-02 07:52:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:06,403 INFO L225 Difference]: With dead ends: 18254 [2018-12-02 07:52:06,404 INFO L226 Difference]: Without dead ends: 11409 [2018-12-02 07:52:06,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 484 SyntacticMatches, 18 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-12-02 07:52:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11409 states. [2018-12-02 07:52:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11409 to 6872. [2018-12-02 07:52:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6872 states. [2018-12-02 07:52:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 10960 transitions. [2018-12-02 07:52:06,918 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 10960 transitions. Word has length 251 [2018-12-02 07:52:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:06,918 INFO L480 AbstractCegarLoop]: Abstraction has 6872 states and 10960 transitions. [2018-12-02 07:52:06,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 07:52:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 10960 transitions. [2018-12-02 07:52:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-02 07:52:06,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:06,920 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:06,920 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:06,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:06,920 INFO L82 PathProgramCache]: Analyzing trace with hash -665499997, now seen corresponding path program 1 times [2018-12-02 07:52:06,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:06,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:06,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:06,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:06,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-02 07:52:06,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:52:06,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:52:06,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:06,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:52:06,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:52:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:52:06,992 INFO L87 Difference]: Start difference. First operand 6872 states and 10960 transitions. Second operand 4 states. [2018-12-02 07:52:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:07,712 INFO L93 Difference]: Finished difference Result 13772 states and 21959 transitions. [2018-12-02 07:52:07,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:52:07,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-12-02 07:52:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:07,719 INFO L225 Difference]: With dead ends: 13772 [2018-12-02 07:52:07,719 INFO L226 Difference]: Without dead ends: 6927 [2018-12-02 07:52:07,724 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-02 07:52:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6927 states. [2018-12-02 07:52:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6927 to 6872. [2018-12-02 07:52:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6872 states. [2018-12-02 07:52:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 10957 transitions. [2018-12-02 07:52:08,220 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 10957 transitions. Word has length 257 [2018-12-02 07:52:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:08,220 INFO L480 AbstractCegarLoop]: Abstraction has 6872 states and 10957 transitions. [2018-12-02 07:52:08,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:52:08,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 10957 transitions. [2018-12-02 07:52:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-02 07:52:08,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:08,224 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:08,224 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:08,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:08,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1495566504, now seen corresponding path program 1 times [2018-12-02 07:52:08,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:08,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:08,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-02 07:52:08,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:52:08,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:52:08,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:08,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:52:08,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:52:08,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:52:08,292 INFO L87 Difference]: Start difference. First operand 6872 states and 10957 transitions. Second operand 4 states. [2018-12-02 07:52:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:08,992 INFO L93 Difference]: Finished difference Result 13766 states and 21944 transitions. [2018-12-02 07:52:08,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:52:08,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-12-02 07:52:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:08,998 INFO L225 Difference]: With dead ends: 13766 [2018-12-02 07:52:08,998 INFO L226 Difference]: Without dead ends: 6921 [2018-12-02 07:52:09,002 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-02 07:52:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6921 states. [2018-12-02 07:52:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6921 to 6872. [2018-12-02 07:52:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6872 states. [2018-12-02 07:52:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 10954 transitions. [2018-12-02 07:52:09,497 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 10954 transitions. Word has length 258 [2018-12-02 07:52:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:09,497 INFO L480 AbstractCegarLoop]: Abstraction has 6872 states and 10954 transitions. [2018-12-02 07:52:09,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:52:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 10954 transitions. [2018-12-02 07:52:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-02 07:52:09,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:09,499 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:09,500 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:09,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash 465410482, now seen corresponding path program 1 times [2018-12-02 07:52:09,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:09,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:09,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:09,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:09,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 354 proven. 229 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-12-02 07:52:09,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:09,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:52:09,966 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-12-02 07:52:09,966 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], [154], [157], [159], [164], [167], [169], [174], [177], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [440], [445], [450], [455], [458], [463], [465], [470], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:52:09,968 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:52:09,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:52:10,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:52:10,248 INFO L272 AbstractInterpreter]: Visited 91 different actions 379 times. Merged at 73 different actions 259 times. Never widened. Performed 3121 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3121 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 19 different actions. Largest state had 139 variables. [2018-12-02 07:52:10,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:10,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:52:10,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:10,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:52:10,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:10,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:52:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:10,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:52:10,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,369 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-02 07:52:10,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,383 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-02 07:52:10,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,404 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-02 07:52:10,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,431 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-02 07:52:10,433 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-02 07:52:10,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,435 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-02 07:52:10,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,440 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-02 07:52:10,440 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,447 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,465 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-02 07:52:10,465 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 07:52:10,497 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-02 07:52:10,500 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-02 07:52:10,520 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-02 07:52:10,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,527 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-02 07:52:10,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,541 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-02 07:52:10,541 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,560 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,581 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 107 treesize of output 84 [2018-12-02 07:52:10,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 127 [2018-12-02 07:52:10,589 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,599 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,605 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 07:52:10,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 98 treesize of output 77 [2018-12-02 07:52:10,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,630 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-02 07:52:10,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:52:10,651 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-02 07:52:10,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,657 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-02 07:52:10,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:52:10,680 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-02 07:52:10,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,692 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-02 07:52:10,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,717 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-02 07:52:10,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,726 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-02 07:52:10,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:52:10,746 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-02 07:52:10,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,752 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-02 07:52:10,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:52:10,775 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-02 07:52:10,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,783 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-02 07:52:10,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 07:52:10,805 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-02 07:52:10,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,813 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-02 07:52:10,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,837 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-02 07:52:10,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,843 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-02 07:52:10,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:52:10,864 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-02 07:52:10,866 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-02 07:52:10,866 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-02 07:52:10,868 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-02 07:52:10,881 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-02 07:52:10,882 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-02 07:52:10,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 07:52:10,895 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-02 07:52:10,897 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-02 07:52:10,910 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-02 07:52:10,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,917 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-02 07:52:10,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:10,929 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-02 07:52:10,929 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,945 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,959 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 07:52:10,963 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-02 07:52:10,965 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-02 07:52:10,965 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-02 07:52:10,967 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-02 07:52:10,979 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-02 07:52:10,980 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-02 07:52:10,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:10,992 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 07:52:10,997 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-02 07:52:10,999 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-02 07:52:10,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:11,019 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-02 07:52:11,022 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-02 07:52:11,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:11,037 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-02 07:52:11,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:11,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:11,040 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-02 07:52:11,040 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,048 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,053 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-02 07:52:11,058 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-02 07:52:11,074 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-02 07:52:11,075 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-02 07:52:11,087 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 105 treesize of output 85 [2018-12-02 07:52:11,096 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 80 treesize of output 64 [2018-12-02 07:52:11,096 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-02 07:52:11,101 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-02 07:52:11,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-02 07:52:11,107 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 13 treesize of output 9 [2018-12-02 07:52:11,107 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-02 07:52:11,108 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-02 07:52:11,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:11,112 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:207, output treesize:32 [2018-12-02 07:52:11,137 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-02 07:52:11,138 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-02 07:52:11,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:11,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:11,144 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-02 07:52:11,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,148 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-02 07:52:11,148 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-02 07:52:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 357 proven. 91 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-02 07:52:11,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:52:11,361 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-02 07:52:11,363 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-02 07:52:11,367 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 73 treesize of output 65 [2018-12-02 07:52:11,368 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-02 07:52:11,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:11,373 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:11,374 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 64 treesize of output 80 [2018-12-02 07:52:11,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:11,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-12-02 07:52:11,377 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,383 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 27 treesize of output 14 [2018-12-02 07:52:11,384 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 14 treesize of output 1 [2018-12-02 07:52:11,384 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,386 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,389 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,391 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-02 07:52:11,401 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 14 treesize of output 12 [2018-12-02 07:52:11,402 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 12 treesize of output 1 [2018-12-02 07:52:11,402 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,403 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:11,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:11,404 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:84, output treesize:15 [2018-12-02 07:52:11,415 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-02 07:52:11,416 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-02 07:52:11,418 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-02 07:52:11,419 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-02 07:52:11,420 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-02 07:52:11,421 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-02 07:52:11,422 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-02 07:52:11,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 07:52:11,449 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-02 07:52:11,450 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-02 07:52:11,456 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-02 07:52:11,457 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-02 07:52:11,458 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-02 07:52:11,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-02 07:52:11,469 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-02 07:52:11,471 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-02 07:52:11,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 43 treesize of output 41 [2018-12-02 07:52:11,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 41 treesize of output 37 [2018-12-02 07:52:11,474 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-02 07:52:11,476 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-02 07:52:11,477 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-02 07:52:11,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 07:52:11,500 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-02 07:52:11,502 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-02 07:52:11,510 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-02 07:52:11,511 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-02 07:52:11,512 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-02 07:52:11,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 07:52:11,528 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-02 07:52:11,529 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-02 07:52:11,530 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-02 07:52:11,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 07:52:11,543 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-02 07:52:11,544 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-02 07:52:11,545 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-02 07:52:11,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 07:52:11,558 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-02 07:52:11,559 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-02 07:52:11,567 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-02 07:52:11,568 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-02 07:52:11,569 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-02 07:52:11,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 07:52:11,583 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-02 07:52:11,584 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-02 07:52:11,585 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-02 07:52:11,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 07:52:11,599 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-02 07:52:11,600 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-02 07:52:11,601 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-02 07:52:11,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 07:52:11,615 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-02 07:52:11,617 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-02 07:52:11,623 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-02 07:52:11,624 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-02 07:52:11,631 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-02 07:52:11,632 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-02 07:52:11,633 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-02 07:52:11,633 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:20 [2018-12-02 07:52:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 357 proven. 91 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-02 07:52:11,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:52:11,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 23 [2018-12-02 07:52:11,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:52:11,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 07:52:11,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 07:52:11,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-12-02 07:52:11,765 INFO L87 Difference]: Start difference. First operand 6872 states and 10954 transitions. Second operand 18 states. [2018-12-02 07:52:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:14,668 INFO L93 Difference]: Finished difference Result 14512 states and 23024 transitions. [2018-12-02 07:52:14,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 07:52:14,668 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 264 [2018-12-02 07:52:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:14,674 INFO L225 Difference]: With dead ends: 14512 [2018-12-02 07:52:14,674 INFO L226 Difference]: Without dead ends: 7667 [2018-12-02 07:52:14,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 513 SyntacticMatches, 15 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2018-12-02 07:52:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7667 states. [2018-12-02 07:52:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7667 to 6661. [2018-12-02 07:52:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2018-12-02 07:52:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 10593 transitions. [2018-12-02 07:52:15,184 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 10593 transitions. Word has length 264 [2018-12-02 07:52:15,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:15,184 INFO L480 AbstractCegarLoop]: Abstraction has 6661 states and 10593 transitions. [2018-12-02 07:52:15,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 07:52:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 10593 transitions. [2018-12-02 07:52:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-02 07:52:15,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:15,187 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:15,187 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:15,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1120793380, now seen corresponding path program 1 times [2018-12-02 07:52:15,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:15,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:15,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:15,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:15,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-02 07:52:15,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:52:15,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:52:15,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:15,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:52:15,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:52:15,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:52:15,240 INFO L87 Difference]: Start difference. First operand 6661 states and 10593 transitions. Second operand 4 states. [2018-12-02 07:52:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:15,935 INFO L93 Difference]: Finished difference Result 13344 states and 21216 transitions. [2018-12-02 07:52:15,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:52:15,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2018-12-02 07:52:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:15,941 INFO L225 Difference]: With dead ends: 13344 [2018-12-02 07:52:15,942 INFO L226 Difference]: Without dead ends: 6710 [2018-12-02 07:52:15,946 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-02 07:52:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2018-12-02 07:52:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6661. [2018-12-02 07:52:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2018-12-02 07:52:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 10590 transitions. [2018-12-02 07:52:16,443 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 10590 transitions. Word has length 279 [2018-12-02 07:52:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:16,443 INFO L480 AbstractCegarLoop]: Abstraction has 6661 states and 10590 transitions. [2018-12-02 07:52:16,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:52:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 10590 transitions. [2018-12-02 07:52:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-02 07:52:16,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:16,447 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:16,447 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:16,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1469364017, now seen corresponding path program 1 times [2018-12-02 07:52:16,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:16,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:16,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:16,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:16,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-02 07:52:16,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:52:16,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:52:16,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:16,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:52:16,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:52:16,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:52:16,500 INFO L87 Difference]: Start difference. First operand 6661 states and 10590 transitions. Second operand 4 states. [2018-12-02 07:52:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:17,171 INFO L93 Difference]: Finished difference Result 13332 states and 21195 transitions. [2018-12-02 07:52:17,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:52:17,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2018-12-02 07:52:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:17,179 INFO L225 Difference]: With dead ends: 13332 [2018-12-02 07:52:17,179 INFO L226 Difference]: Without dead ends: 6698 [2018-12-02 07:52:17,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-02 07:52:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2018-12-02 07:52:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 6661. [2018-12-02 07:52:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2018-12-02 07:52:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 10587 transitions. [2018-12-02 07:52:17,709 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 10587 transitions. Word has length 280 [2018-12-02 07:52:17,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:17,709 INFO L480 AbstractCegarLoop]: Abstraction has 6661 states and 10587 transitions. [2018-12-02 07:52:17,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:52:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 10587 transitions. [2018-12-02 07:52:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-02 07:52:17,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:17,711 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 07:52:17,711 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:17,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2074707236, now seen corresponding path program 1 times [2018-12-02 07:52:17,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:17,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:17,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-02 07:52:17,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:52:17,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:52:17,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:17,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:52:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:52:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:52:17,798 INFO L87 Difference]: Start difference. First operand 6661 states and 10587 transitions. Second operand 6 states. [2018-12-02 07:52:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:19,732 INFO L93 Difference]: Finished difference Result 14490 states and 22782 transitions. [2018-12-02 07:52:19,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:52:19,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 280 [2018-12-02 07:52:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:19,738 INFO L225 Difference]: With dead ends: 14490 [2018-12-02 07:52:19,739 INFO L226 Difference]: Without dead ends: 7856 [2018-12-02 07:52:19,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:52:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7856 states. [2018-12-02 07:52:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7856 to 6609. [2018-12-02 07:52:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6609 states. [2018-12-02 07:52:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 10459 transitions. [2018-12-02 07:52:20,250 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 10459 transitions. Word has length 280 [2018-12-02 07:52:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:20,250 INFO L480 AbstractCegarLoop]: Abstraction has 6609 states and 10459 transitions. [2018-12-02 07:52:20,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:52:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 10459 transitions. [2018-12-02 07:52:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-12-02 07:52:20,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:20,252 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:20,252 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:20,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1410139380, now seen corresponding path program 1 times [2018-12-02 07:52:20,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:20,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:20,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:20,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:20,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 541 proven. 16 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-12-02 07:52:20,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:20,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:52:20,375 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-12-02 07:52:20,375 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [62], [64], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [420], [425], [436], [438], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:52:20,377 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:52:20,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:52:20,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:52:20,699 INFO L272 AbstractInterpreter]: Visited 98 different actions 417 times. Merged at 79 different actions 286 times. Never widened. Performed 3501 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3501 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 19 different actions. Largest state had 151 variables. [2018-12-02 07:52:20,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:20,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:52:20,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:20,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:52:20,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:20,729 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:52:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:20,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:52:20,856 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 82 treesize of output 78 [2018-12-02 07:52:20,858 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 67 treesize of output 59 [2018-12-02 07:52:20,858 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-02 07:52:20,863 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-02 07:52:20,865 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 72 treesize of output 68 [2018-12-02 07:52:20,866 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 59 treesize of output 45 [2018-12-02 07:52:20,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:20,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:20,877 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 84 treesize of output 78 [2018-12-02 07:52:20,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2018-12-02 07:52:20,879 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-02 07:52:20,884 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-02 07:52:20,907 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 55 treesize of output 49 [2018-12-02 07:52:20,908 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 49 treesize of output 13 [2018-12-02 07:52:20,908 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:20,909 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:20,911 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 66 treesize of output 60 [2018-12-02 07:52:20,912 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 53 treesize of output 41 [2018-12-02 07:52:20,913 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-02 07:52:20,918 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-02 07:52:20,920 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 70 treesize of output 62 [2018-12-02 07:52:20,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-12-02 07:52:20,922 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-02 07:52:20,926 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-02 07:52:20,959 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2018-12-02 07:52:20,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:20,966 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 39 treesize of output 48 [2018-12-02 07:52:20,966 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:20,995 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 42 treesize of output 41 [2018-12-02 07:52:20,995 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:21,033 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 42 treesize of output 49 [2018-12-02 07:52:21,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:21,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:21,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-12-02 07:52:21,040 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,044 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:21,073 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 3 case distinctions, treesize of input 37 treesize of output 61 [2018-12-02 07:52:21,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:21,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2018-12-02 07:52:21,076 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:21,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:21,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-12-02 07:52:21,092 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,098 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,107 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,111 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 46 treesize of output 36 [2018-12-02 07:52:21,112 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-02 07:52:21,112 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:21,119 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 31 treesize of output 44 [2018-12-02 07:52:21,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:21,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-12-02 07:52:21,121 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,123 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,125 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,127 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-02 07:52:21,128 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-02 07:52:21,128 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,129 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:21,135 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 07:52:21,157 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 19 treesize of output 15 [2018-12-02 07:52:21,158 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 15 treesize of output 3 [2018-12-02 07:52:21,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:21,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 07:52:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-02 07:52:21,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:52:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-02 07:52:21,268 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 07:52:21,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-02 07:52:21,268 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:21,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:52:21,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:52:21,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:52:21,269 INFO L87 Difference]: Start difference. First operand 6609 states and 10459 transitions. Second operand 6 states. [2018-12-02 07:52:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:22,327 INFO L93 Difference]: Finished difference Result 13530 states and 21374 transitions. [2018-12-02 07:52:22,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:52:22,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 281 [2018-12-02 07:52:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:22,333 INFO L225 Difference]: With dead ends: 13530 [2018-12-02 07:52:22,333 INFO L226 Difference]: Without dead ends: 6948 [2018-12-02 07:52:22,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 557 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:52:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2018-12-02 07:52:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 6729. [2018-12-02 07:52:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2018-12-02 07:52:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 10663 transitions. [2018-12-02 07:52:22,865 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 10663 transitions. Word has length 281 [2018-12-02 07:52:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:22,865 INFO L480 AbstractCegarLoop]: Abstraction has 6729 states and 10663 transitions. [2018-12-02 07:52:22,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:52:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 10663 transitions. [2018-12-02 07:52:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-02 07:52:22,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:22,867 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 07:52:22,867 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:22,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash -60846517, now seen corresponding path program 1 times [2018-12-02 07:52:22,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:22,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:22,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:22,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:22,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 541 proven. 17 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-12-02 07:52:22,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:22,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:52:22,976 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-12-02 07:52:22,976 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [62], [64], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [147], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [420], [425], [436], [438], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:52:22,977 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:52:22,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:52:23,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:52:23,294 INFO L272 AbstractInterpreter]: Visited 98 different actions 417 times. Merged at 79 different actions 286 times. Never widened. Performed 3501 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3501 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 19 different actions. Largest state had 151 variables. [2018-12-02 07:52:23,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:23,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:52:23,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:23,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:52:23,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:23,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:52:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:23,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:52:23,421 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 72 treesize of output 68 [2018-12-02 07:52:23,424 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 59 treesize of output 45 [2018-12-02 07:52:23,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,429 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 82 treesize of output 78 [2018-12-02 07:52:23,430 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 67 treesize of output 59 [2018-12-02 07:52:23,431 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-02 07:52:23,436 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-02 07:52:23,437 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 84 treesize of output 78 [2018-12-02 07:52:23,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2018-12-02 07:52:23,439 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-02 07:52:23,444 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-02 07:52:23,482 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 83 [2018-12-02 07:52:23,484 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 66 treesize of output 65 [2018-12-02 07:52:23,484 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,514 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 57 treesize of output 66 [2018-12-02 07:52:23,514 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,559 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 95 [2018-12-02 07:52:23,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 89 [2018-12-02 07:52:23,565 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 62 [2018-12-02 07:52:23,600 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,610 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:23,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,648 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 3 case distinctions, treesize of input 55 treesize of output 79 [2018-12-02 07:52:23,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2018-12-02 07:52:23,652 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 62 [2018-12-02 07:52:23,672 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,682 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:23,690 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,691 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 55 treesize of output 45 [2018-12-02 07:52:23,693 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-02 07:52:23,693 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,698 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 35 treesize of output 41 [2018-12-02 07:52:23,702 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 32 treesize of output 15 [2018-12-02 07:52:23,702 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,704 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,707 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,713 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 70 treesize of output 60 [2018-12-02 07:52:23,714 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-02 07:52:23,714 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,727 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 49 treesize of output 56 [2018-12-02 07:52:23,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:23,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-12-02 07:52:23,731 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,733 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,735 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,745 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 20 treesize of output 18 [2018-12-02 07:52:23,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-12-02 07:52:23,746 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,747 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,748 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 25 treesize of output 21 [2018-12-02 07:52:23,749 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 21 treesize of output 9 [2018-12-02 07:52:23,749 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,750 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:23,753 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 07:52:23,775 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 19 treesize of output 15 [2018-12-02 07:52:23,776 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 15 treesize of output 3 [2018-12-02 07:52:23,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:23,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 07:52:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-02 07:52:23,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:52:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-02 07:52:23,880 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 07:52:23,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-02 07:52:23,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:23,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:52:23,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:52:23,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:52:23,880 INFO L87 Difference]: Start difference. First operand 6729 states and 10663 transitions. Second operand 6 states. [2018-12-02 07:52:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:24,880 INFO L93 Difference]: Finished difference Result 13642 states and 21566 transitions. [2018-12-02 07:52:24,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:52:24,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 282 [2018-12-02 07:52:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:24,886 INFO L225 Difference]: With dead ends: 13642 [2018-12-02 07:52:24,886 INFO L226 Difference]: Without dead ends: 6940 [2018-12-02 07:52:24,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 559 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:52:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2018-12-02 07:52:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 6733. [2018-12-02 07:52:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6733 states. [2018-12-02 07:52:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 10667 transitions. [2018-12-02 07:52:25,402 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 10667 transitions. Word has length 282 [2018-12-02 07:52:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:25,402 INFO L480 AbstractCegarLoop]: Abstraction has 6733 states and 10667 transitions. [2018-12-02 07:52:25,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:52:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 10667 transitions. [2018-12-02 07:52:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-02 07:52:25,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:25,405 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 07:52:25,405 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:25,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1540001408, now seen corresponding path program 1 times [2018-12-02 07:52:25,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:25,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:25,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-12-02 07:52:25,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:52:25,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:52:25,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:25,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:52:25,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:52:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:52:25,492 INFO L87 Difference]: Start difference. First operand 6733 states and 10667 transitions. Second operand 5 states. [2018-12-02 07:52:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:26,568 INFO L93 Difference]: Finished difference Result 13938 states and 21963 transitions. [2018-12-02 07:52:26,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:52:26,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 282 [2018-12-02 07:52:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:26,574 INFO L225 Difference]: With dead ends: 13938 [2018-12-02 07:52:26,574 INFO L226 Difference]: Without dead ends: 7232 [2018-12-02 07:52:26,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:52:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7232 states. [2018-12-02 07:52:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7232 to 6673. [2018-12-02 07:52:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6673 states. [2018-12-02 07:52:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6673 states to 6673 states and 10547 transitions. [2018-12-02 07:52:27,088 INFO L78 Accepts]: Start accepts. Automaton has 6673 states and 10547 transitions. Word has length 282 [2018-12-02 07:52:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:27,088 INFO L480 AbstractCegarLoop]: Abstraction has 6673 states and 10547 transitions. [2018-12-02 07:52:27,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:52:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6673 states and 10547 transitions. [2018-12-02 07:52:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-02 07:52:27,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:27,090 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:27,090 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:27,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash -237532608, now seen corresponding path program 1 times [2018-12-02 07:52:27,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:27,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:27,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2018-12-02 07:52:27,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:52:27,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:52:27,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:27,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:52:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:52:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:52:27,149 INFO L87 Difference]: Start difference. First operand 6673 states and 10547 transitions. Second operand 3 states. [2018-12-02 07:52:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:27,871 INFO L93 Difference]: Finished difference Result 16228 states and 25452 transitions. [2018-12-02 07:52:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:52:27,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-12-02 07:52:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:27,878 INFO L225 Difference]: With dead ends: 16228 [2018-12-02 07:52:27,878 INFO L226 Difference]: Without dead ends: 9582 [2018-12-02 07:52:27,883 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-02 07:52:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9582 states. [2018-12-02 07:52:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9582 to 9578. [2018-12-02 07:52:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-02 07:52:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 14904 transitions. [2018-12-02 07:52:28,672 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 14904 transitions. Word has length 285 [2018-12-02 07:52:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:28,672 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 14904 transitions. [2018-12-02 07:52:28,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:52:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 14904 transitions. [2018-12-02 07:52:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-02 07:52:28,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:28,676 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:28,676 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:28,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash -307559414, now seen corresponding path program 1 times [2018-12-02 07:52:28,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:28,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:28,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 593 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-02 07:52:28,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:28,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:52:28,792 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-12-02 07:52:28,792 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [62], [64], [69], [74], [77], [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], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:52:28,794 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:52:28,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:52:29,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:52:29,116 INFO L272 AbstractInterpreter]: Visited 95 different actions 403 times. Merged at 77 different actions 279 times. Never widened. Performed 3341 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3341 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 17 different actions. Largest state had 148 variables. [2018-12-02 07:52:29,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:29,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:52:29,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:29,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:52:29,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:29,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:52:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:29,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:52:29,227 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 20 treesize of output 16 [2018-12-02 07:52:29,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 07:52:29,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 07:52:29,271 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2018-12-02 07:52:29,273 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 84 treesize of output 83 [2018-12-02 07:52:29,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,304 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 75 treesize of output 90 [2018-12-02 07:52:29,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,336 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 76 treesize of output 89 [2018-12-02 07:52:29,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-12-02 07:52:29,341 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,345 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,380 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 3 case distinctions, treesize of input 73 treesize of output 109 [2018-12-02 07:52:29,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 61 [2018-12-02 07:52:29,383 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-12-02 07:52:29,403 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,413 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:29,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,426 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 72 treesize of output 62 [2018-12-02 07:52:29,427 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-02 07:52:29,427 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,434 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 41 treesize of output 53 [2018-12-02 07:52:29,436 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:29,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-02 07:52:29,436 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,439 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,442 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,446 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 82 treesize of output 72 [2018-12-02 07:52:29,447 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-02 07:52:29,448 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,455 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 61 treesize of output 80 [2018-12-02 07:52:29,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:29,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2018-12-02 07:52:29,457 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,459 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,462 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-02 07:52:29,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 22 treesize of output 20 [2018-12-02 07:52:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-12-02 07:52:29,474 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,475 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,476 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 42 treesize of output 38 [2018-12-02 07:52:29,478 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 29 treesize of output 15 [2018-12-02 07:52:29,478 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,480 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,486 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 25 treesize of output 21 [2018-12-02 07:52:29,487 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 21 treesize of output 9 [2018-12-02 07:52:29,487 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,488 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:29,490 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 07:52:29,499 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 19 treesize of output 15 [2018-12-02 07:52:29,500 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 15 treesize of output 3 [2018-12-02 07:52:29,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,505 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 19 treesize of output 15 [2018-12-02 07:52:29,506 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 15 treesize of output 3 [2018-12-02 07:52:29,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:29,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-02 07:52:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 563 proven. 10 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-12-02 07:52:29,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:52:29,576 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:29,576 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-02 07:52:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-12-02 07:52:29,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:52:29,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 11 [2018-12-02 07:52:29,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:29,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:52:29,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:52:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:52:29,621 INFO L87 Difference]: Start difference. First operand 9578 states and 14904 transitions. Second operand 4 states. [2018-12-02 07:52:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:31,050 INFO L93 Difference]: Finished difference Result 19850 states and 30724 transitions. [2018-12-02 07:52:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:52:31,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-12-02 07:52:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:31,058 INFO L225 Difference]: With dead ends: 19850 [2018-12-02 07:52:31,058 INFO L226 Difference]: Without dead ends: 10326 [2018-12-02 07:52:31,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 568 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-02 07:52:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10326 states. [2018-12-02 07:52:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10326 to 9578. [2018-12-02 07:52:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-02 07:52:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 14773 transitions. [2018-12-02 07:52:31,865 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 14773 transitions. Word has length 285 [2018-12-02 07:52:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:31,865 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 14773 transitions. [2018-12-02 07:52:31,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:52:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 14773 transitions. [2018-12-02 07:52:31,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-02 07:52:31,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:31,869 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:31,869 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:31,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1429227305, now seen corresponding path program 1 times [2018-12-02 07:52:31,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:31,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:31,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:31,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:31,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 554 proven. 15 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-12-02 07:52:31,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:31,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:52:31,985 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2018-12-02 07:52:31,986 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [62], [64], [69], [74], [77], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [137], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-02 07:52:31,987 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:52:31,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:52:32,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:52:32,221 INFO L272 AbstractInterpreter]: Visited 96 different actions 332 times. Merged at 76 different actions 211 times. Never widened. Performed 2627 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2627 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 17 different actions. Largest state had 148 variables. [2018-12-02 07:52:32,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:32,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:52:32,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:32,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:52:32,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:32,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:52:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:32,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:52:32,349 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 82 treesize of output 78 [2018-12-02 07:52:32,350 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 67 treesize of output 59 [2018-12-02 07:52:32,351 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-02 07:52:32,358 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-02 07:52:32,359 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 72 treesize of output 68 [2018-12-02 07:52:32,361 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 59 treesize of output 45 [2018-12-02 07:52:32,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,370 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 84 treesize of output 78 [2018-12-02 07:52:32,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2018-12-02 07:52:32,372 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-02 07:52:32,377 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-02 07:52:32,404 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 70 treesize of output 62 [2018-12-02 07:52:32,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-12-02 07:52:32,406 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-02 07:52:32,409 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-02 07:52:32,411 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 55 treesize of output 49 [2018-12-02 07:52:32,412 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 49 treesize of output 13 [2018-12-02 07:52:32,412 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,413 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,414 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 66 treesize of output 60 [2018-12-02 07:52:32,415 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 53 treesize of output 41 [2018-12-02 07:52:32,416 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-02 07:52:32,420 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-02 07:52:32,441 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-02 07:52:32,442 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-02 07:52:32,442 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,443 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,447 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 46 treesize of output 36 [2018-12-02 07:52:32,448 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-02 07:52:32,448 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,455 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 31 treesize of output 44 [2018-12-02 07:52:32,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-12-02 07:52:32,457 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,459 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,461 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-02 07:52:32,475 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2018-12-02 07:52:32,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,479 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 39 treesize of output 48 [2018-12-02 07:52:32,479 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,508 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 42 treesize of output 41 [2018-12-02 07:52:32,508 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,548 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 77 [2018-12-02 07:52:32,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 71 [2018-12-02 07:52:32,553 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-12-02 07:52:32,572 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,581 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:32,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,608 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 3 case distinctions, treesize of input 37 treesize of output 61 [2018-12-02 07:52:32,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-12-02 07:52:32,615 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:32,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-02 07:52:32,633 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,640 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,648 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:32,655 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 07:52:32,676 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 19 treesize of output 15 [2018-12-02 07:52:32,678 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 15 treesize of output 3 [2018-12-02 07:52:32,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:32,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 07:52:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-12-02 07:52:32,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:52:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-12-02 07:52:32,777 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 07:52:32,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-02 07:52:32,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:52:32,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:52:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:52:32,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:52:32,778 INFO L87 Difference]: Start difference. First operand 9578 states and 14773 transitions. Second operand 6 states. [2018-12-02 07:52:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:52:33,988 INFO L93 Difference]: Finished difference Result 18929 states and 29091 transitions. [2018-12-02 07:52:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:52:33,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2018-12-02 07:52:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:52:33,996 INFO L225 Difference]: With dead ends: 18929 [2018-12-02 07:52:33,996 INFO L226 Difference]: Without dead ends: 9895 [2018-12-02 07:52:34,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 567 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:52:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9895 states. [2018-12-02 07:52:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9895 to 9578. [2018-12-02 07:52:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-02 07:52:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 14765 transitions. [2018-12-02 07:52:34,788 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 14765 transitions. Word has length 286 [2018-12-02 07:52:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:52:34,788 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 14765 transitions. [2018-12-02 07:52:34,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:52:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 14765 transitions. [2018-12-02 07:52:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-02 07:52:34,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:52:34,792 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:52:34,792 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:52:34,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:52:34,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1534309706, now seen corresponding path program 2 times [2018-12-02 07:52:34,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:52:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:34,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:52:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:52:34,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:52:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:52:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 421 proven. 445 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-02 07:52:35,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:35,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:52:35,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:52:35,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:52:35,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:52:35,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:52:35,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:52:35,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:52:43,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-02 07:52:43,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:52:43,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:52:43,444 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 19 treesize of output 16 [2018-12-02 07:52:43,448 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 16 treesize of output 1 [2018-12-02 07:52:43,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:43,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:43,497 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-02 07:52:43,500 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-02 07:52:43,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:43,531 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 72 [2018-12-02 07:52:43,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,543 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 2 case distinctions, treesize of input 52 treesize of output 73 [2018-12-02 07:52:43,543 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 07:52:43,625 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 55 treesize of output 54 [2018-12-02 07:52:43,625 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:43,730 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 3 case distinctions, treesize of input 47 treesize of output 67 [2018-12-02 07:52:43,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 113 [2018-12-02 07:52:43,746 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 07:52:43,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 07:52:43,815 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-02 07:52:43,863 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:52:43,973 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 57 treesize of output 52 [2018-12-02 07:52:43,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:43,978 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 30 treesize of output 73 [2018-12-02 07:52:43,978 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:43,991 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,078 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 3 case distinctions, treesize of input 44 treesize of output 66 [2018-12-02 07:52:44,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 07:52:44,096 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-02 07:52:44,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,149 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 39 treesize of output 58 [2018-12-02 07:52:44,150 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,178 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:44,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:52:44,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:52:44,431 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 137 [2018-12-02 07:52:44,439 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 139 treesize of output 99 [2018-12-02 07:52:44,439 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,573 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 88 [2018-12-02 07:52:44,573 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-02 07:52:44,612 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:44,619 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 139 treesize of output 114 [2018-12-02 07:52:44,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,624 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 83 treesize of output 106 [2018-12-02 07:52:44,624 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,637 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,644 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 157 treesize of output 128 [2018-12-02 07:52:44,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,649 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 115 treesize of output 142 [2018-12-02 07:52:44,649 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,662 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,737 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 127 treesize of output 112 [2018-12-02 07:52:44,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,740 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 99 treesize of output 103 [2018-12-02 07:52:44,741 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,750 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,753 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 109 treesize of output 98 [2018-12-02 07:52:44,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,757 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 67 treesize of output 67 [2018-12-02 07:52:44,757 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,767 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,770 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 97 treesize of output 94 [2018-12-02 07:52:44,772 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 16 treesize of output 1 [2018-12-02 07:52:44,772 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,779 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,782 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 108 treesize of output 97 [2018-12-02 07:52:44,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,786 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 79 treesize of output 79 [2018-12-02 07:52:44,786 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,796 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,857 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 78 treesize of output 67 [2018-12-02 07:52:44,859 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:44,862 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 9 [2018-12-02 07:52:44,862 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,867 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,872 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 108 treesize of output 91 [2018-12-02 07:52:44,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 121 [2018-12-02 07:52:44,876 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,884 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,901 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 3 case distinctions, treesize of input 89 treesize of output 103 [2018-12-02 07:52:44,904 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 90 treesize of output 50 [2018-12-02 07:52:44,904 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,944 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 94 [2018-12-02 07:52:44,945 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-02 07:52:44,962 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:44,966 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 90 treesize of output 75 [2018-12-02 07:52:44,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:44,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 94 [2018-12-02 07:52:44,970 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:44,977 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,015 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 59 treesize of output 54 [2018-12-02 07:52:45,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:45,019 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 36 treesize of output 30 [2018-12-02 07:52:45,019 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,024 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,028 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 66 treesize of output 61 [2018-12-02 07:52:45,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:45,031 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 34 treesize of output 49 [2018-12-02 07:52:45,032 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,038 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,041 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 90 treesize of output 77 [2018-12-02 07:52:45,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:45,045 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 53 treesize of output 76 [2018-12-02 07:52:45,046 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,059 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,061 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 47 treesize of output 44 [2018-12-02 07:52:45,063 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 16 treesize of output 1 [2018-12-02 07:52:45,063 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,066 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 07:52:45,088 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 6 variables, input treesize:268, output treesize:199 [2018-12-02 07:52:45,146 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:45,146 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 141 treesize of output 137 [2018-12-02 07:52:45,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:45,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:45,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:45,153 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:45,153 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:45,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:45,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 158 [2018-12-02 07:52:45,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,456 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 117 treesize of output 110 [2018-12-02 07:52:45,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:45,461 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 61 treesize of output 84 [2018-12-02 07:52:45,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,771 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 106 treesize of output 95 [2018-12-02 07:52:45,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:45,774 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 60 treesize of output 60 [2018-12-02 07:52:45,775 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:45,786 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 93 [2018-12-02 07:52:46,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,010 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 72 treesize of output 72 [2018-12-02 07:52:46,010 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,022 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,213 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 112 treesize of output 105 [2018-12-02 07:52:46,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,218 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 65 treesize of output 61 [2018-12-02 07:52:46,218 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,229 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,402 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 3 case distinctions, treesize of input 100 treesize of output 118 [2018-12-02 07:52:46,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 101 treesize of output 157 [2018-12-02 07:52:46,417 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 171 [2018-12-02 07:52:46,490 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-02 07:52:46,558 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:52:46,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,740 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 85 treesize of output 100 [2018-12-02 07:52:46,742 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:46,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 134 [2018-12-02 07:52:46,743 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,751 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,897 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 97 treesize of output 90 [2018-12-02 07:52:46,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,901 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 50 treesize of output 46 [2018-12-02 07:52:46,901 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,910 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,913 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 123 treesize of output 110 [2018-12-02 07:52:46,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,916 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 88 treesize of output 90 [2018-12-02 07:52:46,916 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,926 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,928 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 104 treesize of output 99 [2018-12-02 07:52:46,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:46,931 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 24 treesize of output 18 [2018-12-02 07:52:46,932 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:46,943 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,056 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 78 treesize of output 73 [2018-12-02 07:52:47,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,060 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 42 treesize of output 36 [2018-12-02 07:52:47,060 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,068 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,070 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 85 treesize of output 78 [2018-12-02 07:52:47,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,073 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 48 treesize of output 44 [2018-12-02 07:52:47,074 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,082 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,084 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 104 treesize of output 99 [2018-12-02 07:52:47,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,095 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 51 treesize of output 45 [2018-12-02 07:52:47,095 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,106 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 123 [2018-12-02 07:52:47,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,208 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 122 treesize of output 158 [2018-12-02 07:52:47,208 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 79 treesize of output 161 [2018-12-02 07:52:47,246 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,275 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:47,367 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 90 treesize of output 81 [2018-12-02 07:52:47,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,371 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 69 treesize of output 67 [2018-12-02 07:52:47,371 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,379 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,381 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 91 treesize of output 86 [2018-12-02 07:52:47,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,384 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 24 treesize of output 18 [2018-12-02 07:52:47,385 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,393 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,474 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 87 treesize of output 80 [2018-12-02 07:52:47,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,476 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 53 treesize of output 76 [2018-12-02 07:52:47,477 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,484 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-02 07:52:47,539 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 12 variables, input treesize:471, output treesize:428 [2018-12-02 07:52:47,675 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 70 treesize of output 62 [2018-12-02 07:52:47,676 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 58 treesize of output 35 [2018-12-02 07:52:47,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,690 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 35 treesize of output 29 [2018-12-02 07:52:47,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 33 [2018-12-02 07:52:47,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:47,763 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 68 treesize of output 52 [2018-12-02 07:52:47,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-12-02 07:52:47,769 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,776 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 13 treesize of output 1 [2018-12-02 07:52:47,776 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,778 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,825 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 94 treesize of output 64 [2018-12-02 07:52:47,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 92 [2018-12-02 07:52:47,842 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-12-02 07:52:47,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2018-12-02 07:52:47,899 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:47,930 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 07:52:47,967 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 64 treesize of output 54 [2018-12-02 07:52:47,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:47,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 75 [2018-12-02 07:52:47,985 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-12-02 07:52:48,013 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 07:52:48,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 07:52:48,061 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:411, output treesize:148 [2018-12-02 07:52:48,144 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 52 treesize of output 49 [2018-12-02 07:52:48,145 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 16 treesize of output 1 [2018-12-02 07:52:48,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:48,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:48,171 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 78 treesize of output 69 [2018-12-02 07:52:48,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:48,174 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-12-02 07:52:48,175 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:48,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:48,198 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 59 treesize of output 56 [2018-12-02 07:52:48,200 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 16 treesize of output 1 [2018-12-02 07:52:48,200 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:48,209 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:48,224 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 33 treesize of output 28 [2018-12-02 07:52:48,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:48,226 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 25 treesize of output 19 [2018-12-02 07:52:48,226 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:48,230 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:48,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:48,238 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:131, output treesize:55 [2018-12-02 07:52:48,356 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 288 treesize of output 281 [2018-12-02 07:52:48,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:48,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 284 [2018-12-02 07:52:48,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:48,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:48,860 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 279 treesize of output 239 [2018-12-02 07:52:48,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:48,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:49,865 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-02 07:52:49,949 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-02 07:52:50,722 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-02 07:52:50,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-02 07:52:51,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 198 [2018-12-02 07:52:51,428 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-02 07:52:51,428 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:51,510 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 3 case distinctions, treesize of input 40 treesize of output 64 [2018-12-02 07:52:51,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 49 [2018-12-02 07:52:51,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:51,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:51,521 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-02 07:52:51,521 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:51,541 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:51,591 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:51,631 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:52,095 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:52,123 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:52,482 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 183 treesize of output 170 [2018-12-02 07:52:52,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:52,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 123 [2018-12-02 07:52:52,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:52,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:52,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:52,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 135 [2018-12-02 07:52:52,523 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:52,535 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:52,556 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:52,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 228 [2018-12-02 07:52:52,842 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-02 07:52:52,842 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:52,902 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 40 treesize of output 47 [2018-12-02 07:52:52,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 07:52:52,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:52,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:52,911 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-02 07:52:52,911 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:52,923 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:52,935 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:52,980 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,201 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 153 [2018-12-02 07:52:53,204 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 144 treesize of output 143 [2018-12-02 07:52:53,204 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,344 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 113 treesize of output 159 [2018-12-02 07:52:53,344 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,476 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 136 treesize of output 107 [2018-12-02 07:52:53,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,486 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2018-12-02 07:52:53,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 196 [2018-12-02 07:52:53,503 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,516 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,526 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,636 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 3 case distinctions, treesize of input 133 treesize of output 147 [2018-12-02 07:52:53,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 158 [2018-12-02 07:52:53,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 151 [2018-12-02 07:52:53,659 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,680 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,735 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 120 treesize of output 130 [2018-12-02 07:52:53,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:53,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 112 [2018-12-02 07:52:53,742 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,757 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,778 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,819 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:53,907 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:53,941 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:54,013 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:54,049 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:54,138 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 220 treesize of output 221 [2018-12-02 07:52:54,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 07:52:54,140 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,169 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,242 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 140 [2018-12-02 07:52:54,245 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-02 07:52:54,245 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,272 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 77 treesize of output 71 [2018-12-02 07:52:54,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,275 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 68 treesize of output 78 [2018-12-02 07:52:54,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,283 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 70 treesize of output 86 [2018-12-02 07:52:54,283 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,292 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,298 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,312 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,350 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 121 treesize of output 114 [2018-12-02 07:52:54,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,353 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-02 07:52:54,353 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,366 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,399 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 102 treesize of output 95 [2018-12-02 07:52:54,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,403 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-02 07:52:54,403 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,413 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:54,439 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 14 variables, input treesize:551, output treesize:133 [2018-12-02 07:52:54,590 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 84 treesize of output 78 [2018-12-02 07:52:54,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2018-12-02 07:52:54,592 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-02 07:52:54,599 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-02 07:52:54,621 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 86 treesize of output 82 [2018-12-02 07:52:54,623 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-02 07:52:54,624 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-02 07:52:54,632 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-02 07:52:54,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,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 3 case distinctions, treesize of input 74 treesize of output 98 [2018-12-02 07:52:54,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,667 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 91 treesize of output 121 [2018-12-02 07:52:54,667 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 66 treesize of output 148 [2018-12-02 07:52:54,702 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,726 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:54,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,759 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 66 treesize of output 79 [2018-12-02 07:52:54,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,762 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 57 treesize of output 87 [2018-12-02 07:52:54,763 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,771 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,797 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 78 treesize of output 70 [2018-12-02 07:52:54,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 55 treesize of output 39 [2018-12-02 07:52:54,798 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:54,805 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:54,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-12-02 07:52:54,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-12-02 07:52:54,808 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:54,814 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:54,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-12-02 07:52:54,839 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 33 treesize of output 25 [2018-12-02 07:52:54,839 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:54,844 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:54,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 07:52:54,866 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:171, output treesize:140 [2018-12-02 07:52:54,942 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 58 treesize of output 48 [2018-12-02 07:52:54,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-12-02 07:52:54,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,969 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 50 treesize of output 40 [2018-12-02 07:52:54,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:54,971 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 26 treesize of output 24 [2018-12-02 07:52:54,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,977 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 15 treesize of output 3 [2018-12-02 07:52:54,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:54,991 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:109, output treesize:7 [2018-12-02 07:52:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 683 proven. 68 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 07:52:55,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:52:55,427 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-02 07:52:55,432 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-02 07:52:55,470 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-02 07:52:55,477 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-02 07:52:55,512 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-02 07:52:55,519 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-02 07:52:55,540 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-02 07:52:55,544 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-02 07:52:55,569 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-02 07:52:55,572 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-02 07:52:55,585 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 126 treesize of output 94 [2018-12-02 07:52:55,602 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 23 treesize of output 22 [2018-12-02 07:52:55,602 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:55,625 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:55,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2018-12-02 07:52:55,629 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 14 treesize of output 1 [2018-12-02 07:52:55,629 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:55,638 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 47 treesize of output 1 [2018-12-02 07:52:55,638 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:55,640 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:55,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:55,644 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 92 [2018-12-02 07:52:55,646 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:55,646 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:55,647 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 72 treesize of output 101 [2018-12-02 07:52:55,667 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:55,668 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:55,669 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:55,669 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:55,670 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:55,671 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:55,671 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 114 treesize of output 156 [2018-12-02 07:52:55,671 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:55,679 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:55,690 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:55,702 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:52:55,719 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:55,725 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:55,726 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-02 07:52:55,728 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-02 07:52:55,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 07:52:55,736 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:322, output treesize:197 [2018-12-02 07:52:55,792 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-02 07:52:55,795 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-02 07:52:55,802 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-02 07:52:55,804 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-02 07:52:55,807 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 93 treesize of output 91 [2018-12-02 07:52:55,810 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 86 treesize of output 82 [2018-12-02 07:52:55,810 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-02 07:52:55,812 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-02 07:52:55,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:55,814 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:94, output treesize:82 [2018-12-02 07:52:56,143 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-02 07:52:56,146 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-02 07:52:56,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:10, output treesize:1 [2018-12-02 07:52:56,252 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-02 07:52:56,257 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-02 07:52:56,288 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-02 07:52:56,294 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-02 07:52:56,321 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-02 07:52:56,327 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-02 07:52:56,346 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-02 07:52:56,350 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-02 07:52:56,364 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-02 07:52:56,368 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-02 07:52:56,386 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-02 07:52:56,389 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-02 07:52:56,396 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 164 treesize of output 132 [2018-12-02 07:52:56,414 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 23 treesize of output 22 [2018-12-02 07:52:56,414 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,432 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:56,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 162 [2018-12-02 07:52:56,435 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 14 treesize of output 1 [2018-12-02 07:52:56,435 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,442 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 47 treesize of output 1 [2018-12-02 07:52:56,442 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,444 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:52:56,446 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 130 [2018-12-02 07:52:56,449 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:56,449 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:56,450 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 72 treesize of output 101 [2018-12-02 07:52:56,469 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:56,469 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:56,470 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:56,470 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:56,471 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:56,471 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 07:52:56,472 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 114 treesize of output 156 [2018-12-02 07:52:56,472 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,478 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,487 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,497 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-02 07:52:56,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 07:52:56,505 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:322, output treesize:197 [2018-12-02 07:52:56,556 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-02 07:52:56,559 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-02 07:52:56,564 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-02 07:52:56,567 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-02 07:52:56,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:56,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:93 [2018-12-02 07:52:56,702 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-02 07:52:56,705 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-02 07:52:56,712 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-02 07:52:56,715 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-02 07:52:56,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 07:52:56,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:116, output treesize:116 [2018-12-02 07:52:56,790 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-02 07:52:56,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:52:56,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:382, output treesize:1 [2018-12-02 07:52:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 520 proven. 279 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-02 07:52:56,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:52:56,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 19] total 44 [2018-12-02 07:52:56,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:52:56,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 07:52:56,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 07:52:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1681, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 07:52:56,986 INFO L87 Difference]: Start difference. First operand 9578 states and 14765 transitions. Second operand 30 states. [2018-12-02 07:53:05,725 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2018-12-02 07:53:06,550 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2018-12-02 07:53:08,916 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2018-12-02 07:53:11,427 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2018-12-02 07:53:16,845 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2018-12-02 07:53:17,316 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-12-02 07:53:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:20,806 INFO L93 Difference]: Finished difference Result 31801 states and 47543 transitions. [2018-12-02 07:53:20,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-02 07:53:20,806 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 293 [2018-12-02 07:53:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:20,821 INFO L225 Difference]: With dead ends: 31801 [2018-12-02 07:53:20,821 INFO L226 Difference]: Without dead ends: 22277 [2018-12-02 07:53:20,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 554 SyntacticMatches, 20 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2337, Invalid=11003, Unknown=0, NotChecked=0, Total=13340 [2018-12-02 07:53:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22277 states. [2018-12-02 07:53:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22277 to 11537. [2018-12-02 07:53:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11537 states. [2018-12-02 07:53:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 17905 transitions. [2018-12-02 07:53:21,848 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 17905 transitions. Word has length 293 [2018-12-02 07:53:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:21,848 INFO L480 AbstractCegarLoop]: Abstraction has 11537 states and 17905 transitions. [2018-12-02 07:53:21,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 07:53:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 17905 transitions. [2018-12-02 07:53:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-02 07:53:21,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:21,852 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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-02 07:53:21,852 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:21,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1662029545, now seen corresponding path program 1 times [2018-12-02 07:53:21,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:53:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:21,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:53:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:21,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:53:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:53:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:53:22,033 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 07:53:22,088 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24623 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-02 07:53:22,089 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24593 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-02 07:53:22,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:53:22 BoogieIcfgContainer [2018-12-02 07:53:22,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 07:53:22,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:53:22,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:53:22,150 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:53:22,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:50:15" (3/4) ... [2018-12-02 07:53:22,153 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 07:53:22,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:53:22,154 INFO L168 Benchmark]: Toolchain (without parser) took 187358.64 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 974.7 MB). Free memory was 952.4 MB in the beginning and 1.5 GB in the end (delta: -588.4 MB). Peak memory consumption was 386.3 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:22,154 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:53:22,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:22,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:53:22,154 INFO L168 Benchmark]: Boogie Preprocessor took 48.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:22,154 INFO L168 Benchmark]: RCFGBuilder took 610.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 991.4 MB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:22,154 INFO L168 Benchmark]: TraceAbstraction took 186329.15 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 859.8 MB). Free memory was 991.4 MB in the beginning and 1.5 GB in the end (delta: -549.4 MB). Peak memory consumption was 310.4 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:22,155 INFO L168 Benchmark]: Witness Printer took 3.27 ms. Allocated memory is still 2.0 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:53:22,155 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 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 610.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 991.4 MB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 186329.15 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 859.8 MB). Free memory was 991.4 MB in the beginning and 1.5 GB in the end (delta: -549.4 MB). Peak memory consumption was 310.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.27 ms. Allocated memory is still 2.0 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 24623 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 24593 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: 1711]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1434. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24636, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24591: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))={24637:0}, malloc(sizeof(SSL_SESSION))={24581:0}, malloc(sizeof(struct ssl3_state_st))={24631:0}, s={24597:0}, SSLv3_server_data={24591:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24597:0}, SSLv3_server_data={24591: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={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] 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={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->hit=0, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] 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={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={2:-1}, ((s->s3)->tmp.new_cipher)->algorithms=24595, (s->s3)->tmp.new_cipher={24631:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=1, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1371] s->state = 8528 [L1372] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=1, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=1, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] 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={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND TRUE s->state == 8528 [L1376] EXPR s->s3 [L1376] EXPR (s->s3)->tmp.new_cipher [L1376] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1376] l = ((s->s3)->tmp.new_cipher)->algorithms [L1377] EXPR s->options VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->options=24625, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1377] COND TRUE s->options & 2097152UL [L1378] EXPR s->s3 [L1378] (s->s3)->tmp.use_rsa_tmp = 1 [L1382] EXPR s->s3 [L1382] (s->s3)->tmp.use_rsa_tmp VAL [={2:-1}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1382] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1400] ret = __VERIFIER_nondet_int() [L1401] COND FALSE !(ret <= 0) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1418] s->state = 8544 [L1419] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND TRUE s->state == 8544 [L1423] EXPR s->verify_mode VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->verify_mode=24577, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1423] COND TRUE s->verify_mode & 1 [L1424] EXPR s->session [L1424] EXPR (s->session)->peer VAL [={2:-1}, (s->session)->peer={0:0}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->session={24581:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1424] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1434] EXPR s->s3 [L1434] EXPR (s->s3)->tmp.new_cipher [L1434] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={2:-1}, ((s->s3)->tmp.new_cipher)->algorithms=24595, (s->s3)->tmp.new_cipher={24631:0}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1434] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1444] EXPR s->s3 [L1444] (s->s3)->tmp.cert_request = 1 [L1445] ret = __VERIFIER_nondet_int() [L1446] COND FALSE !(ret <= 0) [L1451] s->state = 8448 [L1452] EXPR s->s3 [L1452] (s->s3)->tmp.next_state = 8576 [L1453] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND TRUE s->state == 8576 [L1492] ret = __VERIFIER_nondet_int() [L1493] COND FALSE !(ret <= 0) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1498] COND FALSE !(ret == 2) [L1501] ret = __VERIFIER_nondet_int() [L1502] COND FALSE !(ret <= 0) [L1507] s->init_num = 0 [L1508] s->state = 8592 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND TRUE s->state == 8592 [L1513] ret = __VERIFIER_nondet_int() [L1514] COND FALSE !(ret <= 0) [L1519] s->state = 8608 [L1520] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1217] COND TRUE s->state == 8608 [L1524] ret = __VERIFIER_nondet_int() [L1525] COND FALSE !(ret <= 0) [L1530] s->state = 8640 [L1531] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1223] COND TRUE s->state == 8640 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND FALSE !(blastFlag == 4) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1711] __VERIFIER_error() VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 1 error locations. UNSAFE Result, 186.2s OverallTime, 153 OverallIterations, 12 TraceHistogramMax, 97.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33039 SDtfs, 22606 SDslu, 67645 SDs, 0 SdLazy, 55838 SolverSat, 4928 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7260 GetRequests, 6175 SyntacticMatches, 297 SemanticMatches, 788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5380 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11537occurred in iteration=152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.1s AbstIntTime, 10 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 16.4s AutomataMinimizationTime, 152 MinimizatonAttempts, 41851 StatesRemovedByMinimization, 149 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 10.8s SatisfiabilityAnalysisTime, 54.2s InterpolantComputationTime, 26754 NumberOfCodeBlocks, 26576 NumberOfCodeBlocksAsserted, 175 NumberOfCheckSat, 29301 ConstructedInterpolants, 497 QuantifiedInterpolants, 39835512 SizeOfPredicates, 120 NumberOfNonLiveVariables, 11778 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 176 InterpolantComputations, 150 PerfectInterpolantSequences, 49734/52898 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-02 07:53:24,671 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:53:24,673 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:53:24,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:53:24,679 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:53:24,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:53:24,680 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:53:24,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:53:24,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:53:24,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:53:24,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:53:24,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:53:24,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:53:24,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:53:24,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:53:24,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:53:24,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:53:24,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:53:24,687 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:53:24,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:53:24,689 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:53:24,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:53:24,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:53:24,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:53:24,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:53:24,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:53:24,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:53:24,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:53:24,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:53:24,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:53:24,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:53:24,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:53:24,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:53:24,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:53:24,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:53:24,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:53:24,695 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 07:53:24,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:53:24,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:53:24,703 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:53:24,703 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:53:24,703 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 07:53:24,704 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 07:53:24,704 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 07:53:24,704 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 07:53:24,704 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 07:53:24,704 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 07:53:24,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:53:24,704 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:53:24,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:53:24,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:53:24,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 07:53:24,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:53:24,705 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 07:53:24,705 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 07:53:24,705 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 07:53:24,705 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:53:24,705 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:53:24,706 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 07:53:24,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 07:53:24,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:53:24,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:53:24,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:53:24,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:53:24,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:53:24,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:53:24,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:53:24,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 07:53:24,707 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 07:53:24,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:53:24,707 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 07:53:24,707 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 07:53:24,707 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_74ac3f82-e3da-481d-9b81-76726fd8f03e/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 -> 6457dc37db4a96aff5ca373c1a8d071fc7ddce3b [2018-12-02 07:53:24,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:53:24,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:53:24,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:53:24,740 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:53:24,741 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:53:24,741 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-02 07:53:24,786 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data/af63ddef5/7801831d06b649fe93382526abd3d1d0/FLAG88b14bf06 [2018-12-02 07:53:25,213 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:53:25,213 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-02 07:53:25,222 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data/af63ddef5/7801831d06b649fe93382526abd3d1d0/FLAG88b14bf06 [2018-12-02 07:53:25,231 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74ac3f82-e3da-481d-9b81-76726fd8f03e/bin-2019/utaipan/data/af63ddef5/7801831d06b649fe93382526abd3d1d0 [2018-12-02 07:53:25,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:53:25,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:53:25,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:53:25,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:53:25,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:53:25,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:53:25" (1/1) ... [2018-12-02 07:53:25,238 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 02.12 07:53:25, skipping insertion in model container [2018-12-02 07:53:25,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:53:25" (1/1) ... [2018-12-02 07:53:25,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:53:25,270 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:53:25,485 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:53:25,497 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:53:25,615 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:53:25,616 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-02 07:53:25,619 INFO L168 Benchmark]: Toolchain (without parser) took 386.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:25,621 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-02 07:53:25,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:25,623 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 384.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...