./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0116566dfd4e4e63b59200ee97d098541aa6c54d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:20:58,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:20:58,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:20:58,866 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:20:58,866 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:20:58,866 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:20:58,867 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:20:58,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:20:58,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:20:58,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:20:58,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:20:58,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:20:58,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:20:58,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:20:58,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:20:58,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:20:58,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:20:58,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:20:58,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:20:58,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:20:58,875 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:20:58,876 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:20:58,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:20:58,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:20:58,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:20:58,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:20:58,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:20:58,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:20:58,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:20:58,880 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:20:58,880 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:20:58,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:20:58,880 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:20:58,880 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:20:58,881 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:20:58,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:20:58,881 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 01:20:58,888 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:20:58,889 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:20:58,889 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:20:58,889 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:20:58,889 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 01:20:58,890 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 01:20:58,890 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 01:20:58,891 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:20:58,891 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:20:58,891 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:20:58,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:20:58,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:20:58,891 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:20:58,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:20:58,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:20:58,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:20:58,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:20:58,891 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 01:20:58,892 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:20:58,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0116566dfd4e4e63b59200ee97d098541aa6c54d [2018-12-02 01:20:58,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:20:58,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:20:58,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:20:58,922 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:20:58,922 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:20:58,923 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-02 01:20:58,965 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/data/e4225abd2/56a13c653d6e42d2bcf3436d07911637/FLAGc9098aa0c [2018-12-02 01:20:59,398 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:20:59,399 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-02 01:20:59,404 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/data/e4225abd2/56a13c653d6e42d2bcf3436d07911637/FLAGc9098aa0c [2018-12-02 01:20:59,412 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/data/e4225abd2/56a13c653d6e42d2bcf3436d07911637 [2018-12-02 01:20:59,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:20:59,415 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 01:20:59,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:20:59,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:20:59,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:20:59,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:20:59" (1/1) ... [2018-12-02 01:20:59,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8167c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59, skipping insertion in model container [2018-12-02 01:20:59,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:20:59" (1/1) ... [2018-12-02 01:20:59,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:20:59,447 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:20:59,594 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:20:59,600 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:20:59,656 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:20:59,676 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:20:59,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59 WrapperNode [2018-12-02 01:20:59,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:20:59,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:20:59,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:20:59,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:20:59,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59" (1/1) ... [2018-12-02 01:20:59,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59" (1/1) ... [2018-12-02 01:20:59,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59" (1/1) ... [2018-12-02 01:20:59,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59" (1/1) ... [2018-12-02 01:20:59,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59" (1/1) ... [2018-12-02 01:20:59,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59" (1/1) ... [2018-12-02 01:20:59,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59" (1/1) ... [2018-12-02 01:20:59,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:20:59,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:20:59,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:20:59,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:20:59,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:20:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:20:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:20:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 01:20:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 01:20:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure substring [2018-12-02 01:20:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:20:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 01:20:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 01:20:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 01:20:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 01:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 01:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 01:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 01:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 01:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 01:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 01:20:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 01:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 01:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 01:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 01:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 01:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 01:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 01:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 01:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 01:20:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 01:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 01:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 01:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 01:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 01:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 01:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 01:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 01:20:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 01:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 01:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 01:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 01:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 01:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 01:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 01:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 01:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 01:20:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 01:20:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 01:20:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 01:20:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 01:20:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 01:20:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 01:20:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 01:20:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 01:20:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 01:20:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 01:20:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 01:20:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 01:20:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 01:20:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 01:20:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 01:20:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 01:20:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 01:20:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 01:20:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 01:20:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 01:20:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 01:20:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 01:20:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 01:20:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 01:20:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 01:20:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure substring [2018-12-02 01:20:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 01:20:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:20:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:20:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:20:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:20:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:20:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:20:59,964 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:20:59,965 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 01:20:59,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:20:59 BoogieIcfgContainer [2018-12-02 01:20:59,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:20:59,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:20:59,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:20:59,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:20:59,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:20:59" (1/3) ... [2018-12-02 01:20:59,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ff147d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:20:59, skipping insertion in model container [2018-12-02 01:20:59,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:20:59" (2/3) ... [2018-12-02 01:20:59,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ff147d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:20:59, skipping insertion in model container [2018-12-02 01:20:59,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:20:59" (3/3) ... [2018-12-02 01:20:59,969 INFO L112 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-12-02 01:20:59,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:20:59,979 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 01:20:59,988 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 01:21:00,003 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 01:21:00,003 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:21:00,003 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 01:21:00,003 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:21:00,003 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:21:00,004 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:21:00,004 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:21:00,004 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:21:00,004 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:21:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-02 01:21:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 01:21:00,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:21:00,019 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash 386859026, now seen corresponding path program 1 times [2018-12-02 01:21:00,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,127 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 01:21:00,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:21:00,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:21:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:21:00,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:21:00,140 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-12-02 01:21:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,179 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-02 01:21:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:21:00,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 01:21:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,186 INFO L225 Difference]: With dead ends: 46 [2018-12-02 01:21:00,186 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 01:21:00,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:21:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 01:21:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 01:21:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 01:21:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 01:21:00,209 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2018-12-02 01:21:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,209 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 01:21:00,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:21:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 01:21:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 01:21:00,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:21:00,210 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,210 INFO L82 PathProgramCache]: Analyzing trace with hash 386859027, now seen corresponding path program 1 times [2018-12-02 01:21:00,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,241 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 01:21:00,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:21:00,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:21:00,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:21:00,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:21:00,242 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-02 01:21:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,256 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-02 01:21:00,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:21:00,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 01:21:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,257 INFO L225 Difference]: With dead ends: 42 [2018-12-02 01:21:00,257 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 01:21:00,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 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 01:21:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 01:21:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 01:21:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 01:21:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-02 01:21:00,261 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-12-02 01:21:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,261 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-02 01:21:00,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:21:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-02 01:21:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 01:21:00,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:21:00,262 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash -892272091, now seen corresponding path program 1 times [2018-12-02 01:21:00,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:00,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:21:00,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:21:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:21:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:21:00,282 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-12-02 01:21:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,298 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-02 01:21:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:21:00,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 01:21:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,299 INFO L225 Difference]: With dead ends: 41 [2018-12-02 01:21:00,299 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 01:21:00,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:21:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 01:21:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-02 01:21:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 01:21:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-02 01:21:00,301 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2018-12-02 01:21:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,302 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-02 01:21:00,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:21:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-02 01:21:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 01:21:00,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:21:00,302 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash -892272090, now seen corresponding path program 1 times [2018-12-02 01:21:00,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,339 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 01:21:00,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:21:00,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:21:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:21:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:21:00,340 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-12-02 01:21:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,349 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-02 01:21:00,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:21:00,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 01:21:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,349 INFO L225 Difference]: With dead ends: 40 [2018-12-02 01:21:00,350 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 01:21:00,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 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 01:21:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 01:21:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 01:21:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 01:21:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-02 01:21:00,352 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2018-12-02 01:21:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,352 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-02 01:21:00,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:21:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-02 01:21:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 01:21:00,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:21:00,353 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash -125213255, now seen corresponding path program 1 times [2018-12-02 01:21:00,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,375 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 01:21:00,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:21:00,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:21:00,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:21:00,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:21:00,376 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2018-12-02 01:21:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,417 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-02 01:21:00,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:21:00,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 01:21:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,417 INFO L225 Difference]: With dead ends: 39 [2018-12-02 01:21:00,418 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 01:21:00,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:21:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 01:21:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-02 01:21:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 01:21:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-02 01:21:00,420 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2018-12-02 01:21:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,420 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-02 01:21:00,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:21:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-02 01:21:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 01:21:00,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:21:00,420 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,421 INFO L82 PathProgramCache]: Analyzing trace with hash -125213254, now seen corresponding path program 1 times [2018-12-02 01:21:00,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,477 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 01:21:00,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:21:00,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:21:00,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:21:00,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:21:00,478 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-12-02 01:21:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,553 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-12-02 01:21:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:21:00,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-02 01:21:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,555 INFO L225 Difference]: With dead ends: 61 [2018-12-02 01:21:00,556 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 01:21:00,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:21:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 01:21:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2018-12-02 01:21:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 01:21:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-02 01:21:00,560 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-02 01:21:00,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,561 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-02 01:21:00,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:21:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-02 01:21:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 01:21:00,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:21:00,562 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash -70853378, now seen corresponding path program 1 times [2018-12-02 01:21:00,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,595 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 01:21:00,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:21:00,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:21:00,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:21:00,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:21:00,596 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 6 states. [2018-12-02 01:21:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,652 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-12-02 01:21:00,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:21:00,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-02 01:21:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,652 INFO L225 Difference]: With dead ends: 41 [2018-12-02 01:21:00,652 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 01:21:00,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:21:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 01:21:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-12-02 01:21:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 01:21:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-12-02 01:21:00,655 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 16 [2018-12-02 01:21:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,655 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-12-02 01:21:00,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:21:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-12-02 01:21:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 01:21:00,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:21:00,655 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,656 INFO L82 PathProgramCache]: Analyzing trace with hash -70853377, now seen corresponding path program 1 times [2018-12-02 01:21:00,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,706 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 01:21:00,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:21:00,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:21:00,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:21:00,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:21:00,707 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2018-12-02 01:21:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,786 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-12-02 01:21:00,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:21:00,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-02 01:21:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,786 INFO L225 Difference]: With dead ends: 54 [2018-12-02 01:21:00,786 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 01:21:00,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:21:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 01:21:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-02 01:21:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 01:21:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-12-02 01:21:00,790 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2018-12-02 01:21:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,790 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-02 01:21:00,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:21:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-12-02 01:21:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:21:00,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,791 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] [2018-12-02 01:21:00,791 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,791 INFO L82 PathProgramCache]: Analyzing trace with hash -779049943, now seen corresponding path program 1 times [2018-12-02 01:21:00,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,826 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 01:21:00,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:21:00,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:21:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:21:00,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:21:00,828 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 4 states. [2018-12-02 01:21:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,859 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-02 01:21:00,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:21:00,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 01:21:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,859 INFO L225 Difference]: With dead ends: 44 [2018-12-02 01:21:00,859 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 01:21:00,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:21:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 01:21:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-02 01:21:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 01:21:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-12-02 01:21:00,862 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 20 [2018-12-02 01:21:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,863 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-12-02 01:21:00,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:21:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-12-02 01:21:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:21:00,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,863 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] [2018-12-02 01:21:00,863 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash -755130684, now seen corresponding path program 1 times [2018-12-02 01:21:00,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:00,896 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 01:21:00,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:00,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:21:00,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:21:00,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:21:00,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:21:00,897 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 6 states. [2018-12-02 01:21:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:00,950 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-12-02 01:21:00,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:21:00,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 01:21:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:00,950 INFO L225 Difference]: With dead ends: 39 [2018-12-02 01:21:00,951 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 01:21:00,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:21:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 01:21:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-02 01:21:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 01:21:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-02 01:21:00,953 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2018-12-02 01:21:00,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:00,954 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-02 01:21:00,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:21:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-02 01:21:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:21:00,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:00,954 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] [2018-12-02 01:21:00,955 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:00,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash -755130683, now seen corresponding path program 1 times [2018-12-02 01:21:00,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:00,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:00,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:00,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:01,005 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 01:21:01,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:01,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:21:01,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:21:01,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:21:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:21:01,006 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-12-02 01:21:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:01,069 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-12-02 01:21:01,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:21:01,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-02 01:21:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:01,070 INFO L225 Difference]: With dead ends: 64 [2018-12-02 01:21:01,070 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 01:21:01,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:21:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 01:21:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2018-12-02 01:21:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 01:21:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-02 01:21:01,073 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 20 [2018-12-02 01:21:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:01,073 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-02 01:21:01,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:21:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-02 01:21:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 01:21:01,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:01,074 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] [2018-12-02 01:21:01,074 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:01,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash -755121610, now seen corresponding path program 1 times [2018-12-02 01:21:01,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:01,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:01,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:01,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:21:01,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:21:01,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:21:01,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:21:01,089 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-12-02 01:21:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:01,096 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-02 01:21:01,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:21:01,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 01:21:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:01,097 INFO L225 Difference]: With dead ends: 46 [2018-12-02 01:21:01,097 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 01:21:01,097 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 01:21:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 01:21:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-02 01:21:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 01:21:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-02 01:21:01,099 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 20 [2018-12-02 01:21:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:01,099 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-02 01:21:01,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:21:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-02 01:21:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 01:21:01,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:01,099 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] [2018-12-02 01:21:01,099 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:01,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 177570790, now seen corresponding path program 1 times [2018-12-02 01:21:01,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:01,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:01,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:01,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:21:01,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:21:01,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:21:01,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:21:01,124 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 6 states. [2018-12-02 01:21:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:01,166 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-02 01:21:01,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:21:01,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-02 01:21:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:01,167 INFO L225 Difference]: With dead ends: 50 [2018-12-02 01:21:01,167 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 01:21:01,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:21:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 01:21:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-02 01:21:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 01:21:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-02 01:21:01,170 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-12-02 01:21:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:01,171 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-02 01:21:01,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:21:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-02 01:21:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 01:21:01,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:01,171 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] [2018-12-02 01:21:01,171 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:01,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash 940519430, now seen corresponding path program 1 times [2018-12-02 01:21:01,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:01,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:01,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:01,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:01,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:01,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 01:21:01,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 01:21:01,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 01:21:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-02 01:21:01,322 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 14 states. [2018-12-02 01:21:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:01,551 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-12-02 01:21:01,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 01:21:01,551 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-12-02 01:21:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:01,552 INFO L225 Difference]: With dead ends: 92 [2018-12-02 01:21:01,552 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 01:21:01,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-12-02 01:21:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 01:21:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 61. [2018-12-02 01:21:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 01:21:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-12-02 01:21:01,554 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2018-12-02 01:21:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:01,555 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-12-02 01:21:01,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 01:21:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-12-02 01:21:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 01:21:01,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:01,556 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] [2018-12-02 01:21:01,556 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:01,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash -647828472, now seen corresponding path program 1 times [2018-12-02 01:21:01,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:01,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:01,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:01,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 01:21:01,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 01:21:01,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 01:21:01,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:21:01,645 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 10 states. [2018-12-02 01:21:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:01,716 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-12-02 01:21:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 01:21:01,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-02 01:21:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:01,717 INFO L225 Difference]: With dead ends: 81 [2018-12-02 01:21:01,717 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 01:21:01,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 01:21:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 01:21:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-02 01:21:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 01:21:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-12-02 01:21:01,719 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 23 [2018-12-02 01:21:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:01,720 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-12-02 01:21:01,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 01:21:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-12-02 01:21:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 01:21:01,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:01,721 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] [2018-12-02 01:21:01,721 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:01,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:01,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1668896826, now seen corresponding path program 1 times [2018-12-02 01:21:01,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:01,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:01,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:21:01,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/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 01:21:01,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:01,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:21:01,918 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 14 treesize of output 11 [2018-12-02 01:21:01,920 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 01:21:01,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:01,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:01,929 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 01:21:01,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 01:21:02,030 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 18 treesize of output 14 [2018-12-02 01:21:02,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 01:21:02,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:02,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:21:02,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:21:02,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-02 01:21:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:02,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:21:02,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-12-02 01:21:02,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 01:21:02,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 01:21:02,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-02 01:21:02,137 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 19 states. [2018-12-02 01:21:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:02,684 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-12-02 01:21:02,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 01:21:02,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-12-02 01:21:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:02,685 INFO L225 Difference]: With dead ends: 81 [2018-12-02 01:21:02,685 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 01:21:02,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-02 01:21:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 01:21:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2018-12-02 01:21:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 01:21:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-12-02 01:21:02,688 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 23 [2018-12-02 01:21:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:02,688 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-12-02 01:21:02,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 01:21:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-12-02 01:21:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 01:21:02,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:02,689 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] [2018-12-02 01:21:02,689 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:02,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash -98139660, now seen corresponding path program 1 times [2018-12-02 01:21:02,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:02,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:02,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:02,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:02,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:02,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:21:02,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 01:21:02,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:21:02,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:21:02,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:21:02,758 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 8 states. [2018-12-02 01:21:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:02,806 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-12-02 01:21:02,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:21:02,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-12-02 01:21:02,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:02,807 INFO L225 Difference]: With dead ends: 61 [2018-12-02 01:21:02,807 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 01:21:02,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:21:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 01:21:02,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-02 01:21:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 01:21:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-12-02 01:21:02,809 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 25 [2018-12-02 01:21:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:02,810 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-12-02 01:21:02,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:21:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-12-02 01:21:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 01:21:02,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:02,810 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] [2018-12-02 01:21:02,810 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:02,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1787083402, now seen corresponding path program 1 times [2018-12-02 01:21:02,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:02,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:02,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:02,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:02,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:21:02,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/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 01:21:02,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:02,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:21:02,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:21:02,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:02,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:02,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 01:21:02,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 01:21:02,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 11 treesize of output 10 [2018-12-02 01:21:02,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:02,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:02,974 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 01:21:02,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 01:21:02,995 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 25 treesize of output 26 [2018-12-02 01:21:02,997 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 01:21:02,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:03,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:03,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 01:21:03,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-02 01:21:03,085 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 28 treesize of output 26 [2018-12-02 01:21:03,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 01:21:03,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:03,097 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 01:21:03,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:03,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:21:03,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:21:03,109 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-12-02 01:21:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:03,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:21:03,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-02 01:21:03,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 01:21:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 01:21:03,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-02 01:21:03,171 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 17 states. [2018-12-02 01:21:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:03,548 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2018-12-02 01:21:03,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 01:21:03,549 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-12-02 01:21:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:03,549 INFO L225 Difference]: With dead ends: 110 [2018-12-02 01:21:03,549 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 01:21:03,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-12-02 01:21:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 01:21:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 73. [2018-12-02 01:21:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 01:21:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2018-12-02 01:21:03,551 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 25 [2018-12-02 01:21:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:03,551 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2018-12-02 01:21:03,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 01:21:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2018-12-02 01:21:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 01:21:03,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:03,552 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] [2018-12-02 01:21:03,552 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:03,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash 633122316, now seen corresponding path program 1 times [2018-12-02 01:21:03,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:03,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:03,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:03,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:21:03,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/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 01:21:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:03,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:21:03,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:21:03,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:03,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:03,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 01:21:03,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 01:21:03,792 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 01:21:03,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:03,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:03,798 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 01:21:03,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 01:21:03,825 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 25 treesize of output 26 [2018-12-02 01:21:03,827 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 01:21:03,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:03,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:03,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 01:21:03,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-02 01:21:04,607 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-02 01:21:04,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-12-02 01:21:04,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, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-12-02 01:21:04,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-02 01:21:04,780 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 41 treesize of output 33 [2018-12-02 01:21:04,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:04,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-12-02 01:21:04,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-12-02 01:21:04,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-12-02 01:21:04,910 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:04,983 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 27 treesize of output 20 [2018-12-02 01:21:04,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:04,984 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 23 treesize of output 16 [2018-12-02 01:21:04,985 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:05,052 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 31 treesize of output 23 [2018-12-02 01:21:05,052 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:05,054 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 35 treesize of output 27 [2018-12-02 01:21:05,054 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:05,055 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 34 treesize of output 26 [2018-12-02 01:21:05,056 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:05,137 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 37 treesize of output 29 [2018-12-02 01:21:05,137 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:05,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-12-02 01:21:05,216 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:05,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-02 01:21:05,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:21:05,312 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-02 01:21:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:05,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:21:05,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-12-02 01:21:05,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-02 01:21:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-02 01:21:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2018-12-02 01:21:05,407 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 27 states. [2018-12-02 01:21:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:07,290 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-12-02 01:21:07,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 01:21:07,291 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-02 01:21:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:07,291 INFO L225 Difference]: With dead ends: 86 [2018-12-02 01:21:07,292 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 01:21:07,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 01:21:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 01:21:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2018-12-02 01:21:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 01:21:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2018-12-02 01:21:07,296 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 27 [2018-12-02 01:21:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:07,297 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2018-12-02 01:21:07,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-02 01:21:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2018-12-02 01:21:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 01:21:07,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:07,298 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] [2018-12-02 01:21:07,299 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:07,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2145519455, now seen corresponding path program 2 times [2018-12-02 01:21:07,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:07,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:07,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:07,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:07,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:07,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:21:07,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/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 01:21:07,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 01:21:07,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 01:21:07,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:21:07,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:21:07,507 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 9 treesize of output 12 [2018-12-02 01:21:07,513 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 12 treesize of output 15 [2018-12-02 01:21:07,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:07,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:21:07,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:07,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-02 01:21:07,545 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 16 treesize of output 13 [2018-12-02 01:21:07,546 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 13 treesize of output 12 [2018-12-02 01:21:07,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:07,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:07,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:07,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-02 01:21:07,643 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 01:21:07,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 01:21:07,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:07,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:21:07,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:21:07,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-02 01:21:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:07,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:21:07,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-12-02 01:21:07,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 01:21:07,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 01:21:07,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:21:07,732 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand 20 states. [2018-12-02 01:21:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:08,399 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-12-02 01:21:08,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 01:21:08,399 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-12-02 01:21:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:08,400 INFO L225 Difference]: With dead ends: 86 [2018-12-02 01:21:08,400 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 01:21:08,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2018-12-02 01:21:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 01:21:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 50. [2018-12-02 01:21:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 01:21:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-12-02 01:21:08,402 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 30 [2018-12-02 01:21:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:08,402 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-12-02 01:21:08,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 01:21:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-12-02 01:21:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 01:21:08,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:08,402 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] [2018-12-02 01:21:08,403 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:08,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1646280319, now seen corresponding path program 1 times [2018-12-02 01:21:08,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:08,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:08,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:08,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:21:08,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:08,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:21:08,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/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 01:21:08,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:08,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:21:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:08,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:21:08,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2018-12-02 01:21:08,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 01:21:08,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 01:21:08,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:21:08,493 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-12-02 01:21:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:21:08,556 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-12-02 01:21:08,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 01:21:08,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-12-02 01:21:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:21:08,556 INFO L225 Difference]: With dead ends: 63 [2018-12-02 01:21:08,557 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 01:21:08,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-02 01:21:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 01:21:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-12-02 01:21:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 01:21:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-02 01:21:08,558 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 31 [2018-12-02 01:21:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:21:08,558 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-02 01:21:08,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 01:21:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-02 01:21:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 01:21:08,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:21:08,559 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:21:08,559 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:21:08,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:21:08,559 INFO L82 PathProgramCache]: Analyzing trace with hash 649894181, now seen corresponding path program 2 times [2018-12-02 01:21:08,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:21:08,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:21:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:08,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:21:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:21:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:21:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:08,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:21:08,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/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 01:21:08,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 01:21:08,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 01:21:08,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:21:08,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:21:08,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:21:08,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:08,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:08,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 01:21:08,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 01:21:08,912 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 01:21:08,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:08,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:08,918 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 01:21:08,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-02 01:21:08,940 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 25 treesize of output 26 [2018-12-02 01:21:08,942 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 01:21:08,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:08,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:21:08,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 01:21:08,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-12-02 01:21:09,613 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-12-02 01:21:10,745 WARN L180 SmtUtils]: Spent 812.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-02 01:21:10,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 91 [2018-12-02 01:21:10,883 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 63 treesize of output 56 [2018-12-02 01:21:10,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:11,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:11,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 96 [2018-12-02 01:21:11,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-12-02 01:21:12,398 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 1 case distinctions, treesize of input 59 treesize of output 63 [2018-12-02 01:21:12,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:13,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:13,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 124 [2018-12-02 01:21:13,230 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 01:21:13,234 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 24 xjuncts. [2018-12-02 01:21:14,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:14,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 124 [2018-12-02 01:21:14,221 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 01:21:14,225 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 24 xjuncts. [2018-12-02 01:21:15,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:15,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 81 [2018-12-02 01:21:15,192 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-12-02 01:21:16,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:16,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 120 [2018-12-02 01:21:16,779 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 01:21:16,784 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 30 xjuncts. [2018-12-02 01:21:17,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:17,960 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 63 [2018-12-02 01:21:17,961 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:17,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:17,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:17,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:17,976 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 1 case distinctions, treesize of input 50 treesize of output 55 [2018-12-02 01:21:17,977 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:19,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:19,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 120 [2018-12-02 01:21:19,172 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 01:21:19,176 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 24 xjuncts. [2018-12-02 01:21:20,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:20,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:20,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:20,661 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 1 case distinctions, treesize of input 63 treesize of output 66 [2018-12-02 01:21:20,662 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:21,605 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 56 treesize of output 48 [2018-12-02 01:21:21,605 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:21,608 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 53 treesize of output 45 [2018-12-02 01:21:21,608 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:23,321 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 51 [2018-12-02 01:21:23,322 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:24,683 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 63 treesize of output 55 [2018-12-02 01:21:24,683 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:25,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:25,461 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 63 [2018-12-02 01:21:25,462 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:26,375 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 46 treesize of output 39 [2018-12-02 01:21:26,375 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:26,377 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 49 treesize of output 42 [2018-12-02 01:21:26,378 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:27,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 59 treesize of output 51 [2018-12-02 01:21:27,035 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:27,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:27,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 94 [2018-12-02 01:21:27,702 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 28 xjuncts. [2018-12-02 01:21:28,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:28,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 94 [2018-12-02 01:21:28,936 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 28 xjuncts. [2018-12-02 01:21:29,803 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 47 [2018-12-02 01:21:29,804 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:31,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:31,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 116 [2018-12-02 01:21:31,080 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 01:21:31,091 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 28 xjuncts. [2018-12-02 01:21:32,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:32,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 90 [2018-12-02 01:21:32,525 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 28 xjuncts. [2018-12-02 01:21:33,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:33,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 96 [2018-12-02 01:21:33,134 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 3 xjuncts. [2018-12-02 01:21:35,311 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 71 treesize of output 64 [2018-12-02 01:21:35,311 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:35,313 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 61 treesize of output 54 [2018-12-02 01:21:35,313 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:35,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:35,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:35,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:35,809 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 3 case distinctions, treesize of input 63 treesize of output 85 [2018-12-02 01:21:35,810 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 8 xjuncts. [2018-12-02 01:21:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2018-12-02 01:21:36,965 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:36,966 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 50 [2018-12-02 01:21:36,967 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:36,968 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 64 treesize of output 56 [2018-12-02 01:21:36,968 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:36,970 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 62 treesize of output 54 [2018-12-02 01:21:36,970 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:36,972 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 47 [2018-12-02 01:21:36,972 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:37,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:37,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:37,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:37,826 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 1 case distinctions, treesize of input 59 treesize of output 68 [2018-12-02 01:21:37,827 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:39,054 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 54 [2018-12-02 01:21:39,055 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:39,066 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 57 [2018-12-02 01:21:39,067 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:40,486 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 45 treesize of output 43 [2018-12-02 01:21:40,487 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:40,488 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 48 treesize of output 46 [2018-12-02 01:21:40,489 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:40,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:40,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:40,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:40,983 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 1 case distinctions, treesize of input 55 treesize of output 58 [2018-12-02 01:21:40,983 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:41,467 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 1 case distinctions, treesize of input 63 treesize of output 61 [2018-12-02 01:21:41,467 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:43,608 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 50 [2018-12-02 01:21:43,609 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:43,619 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 53 [2018-12-02 01:21:43,620 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:44,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:44,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:44,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:44,896 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 3 case distinctions, treesize of input 59 treesize of output 81 [2018-12-02 01:21:44,898 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-12-02 01:21:45,552 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 53 treesize of output 45 [2018-12-02 01:21:45,552 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:45,554 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 48 treesize of output 40 [2018-12-02 01:21:45,554 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:46,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2018-12-02 01:21:46,154 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:46,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:46,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:46,156 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 51 treesize of output 45 [2018-12-02 01:21:46,157 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:46,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:46,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:46,159 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 54 treesize of output 48 [2018-12-02 01:21:46,160 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:46,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-12-02 01:21:46,162 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:46,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-12-02 01:21:46,164 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:46,970 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 67 treesize of output 60 [2018-12-02 01:21:46,970 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:47,648 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 59 treesize of output 51 [2018-12-02 01:21:47,648 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:48,604 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 60 treesize of output 52 [2018-12-02 01:21:48,605 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:49,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:49,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:49,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:49,545 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 1 case distinctions, treesize of input 40 treesize of output 45 [2018-12-02 01:21:49,546 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:49,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:49,559 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 53 [2018-12-02 01:21:49,560 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-12-02 01:21:51,218 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 46 treesize of output 41 [2018-12-02 01:21:51,219 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:52,726 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 56 treesize of output 49 [2018-12-02 01:21:52,726 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:52,729 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 53 treesize of output 46 [2018-12-02 01:21:52,730 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:54,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:21:54,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 65 [2018-12-02 01:21:54,517 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 3 xjuncts. [2018-12-02 01:21:54,744 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 41 [2018-12-02 01:21:54,745 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-02 01:21:55,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 57 dim-1 vars, End of recursive call: and 20 xjuncts. [2018-12-02 01:21:55,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 01:21:55,365 INFO L202 ElimStorePlain]: Needed 62 recursive calls to eliminate 9 variables, input treesize:78, output treesize:199 [2018-12-02 01:21:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:21:55,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:21:55,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 35 [2018-12-02 01:21:55,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-02 01:21:55,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-02 01:21:55,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 01:21:55,561 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 36 states. [2018-12-02 01:21:58,016 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-12-02 01:22:00,707 WARN L180 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2018-12-02 01:22:04,331 WARN L180 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-12-02 01:22:09,718 WARN L180 SmtUtils]: Spent 5.35 s on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-12-02 01:22:11,929 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2018-12-02 01:22:16,111 WARN L180 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2018-12-02 01:22:21,893 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2018-12-02 01:22:27,376 WARN L180 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2018-12-02 01:22:28,818 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-12-02 01:22:30,878 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-12-02 01:22:31,904 WARN L180 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2018-12-02 01:22:33,937 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2018-12-02 01:22:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:22:34,389 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-02 01:22:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 01:22:34,389 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 34 [2018-12-02 01:22:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:22:34,390 INFO L225 Difference]: With dead ends: 77 [2018-12-02 01:22:34,390 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 01:22:34,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=416, Invalid=3364, Unknown=2, NotChecked=0, Total=3782 [2018-12-02 01:22:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 01:22:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2018-12-02 01:22:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 01:22:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-12-02 01:22:34,394 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 34 [2018-12-02 01:22:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:22:34,394 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-12-02 01:22:34,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-02 01:22:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-12-02 01:22:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 01:22:34,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:22:34,394 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 01:22:34,394 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:22:34,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:22:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1760882810, now seen corresponding path program 2 times [2018-12-02 01:22:34,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:22:34,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:22:34,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:22:34,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:22:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:22:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:22:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:22:34,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:22:34,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/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 01:22:34,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 01:22:34,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 01:22:34,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:22:34,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:22:34,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 01:22:34,588 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 12 treesize of output 15 [2018-12-02 01:22:34,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:22:34,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,599 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-02 01:22:34,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 01:22:34,613 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 13 treesize of output 12 [2018-12-02 01:22:34,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-12-02 01:22:34,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 01:22:34,637 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 13 treesize of output 12 [2018-12-02 01:22:34,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,645 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 01:22:34,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-12-02 01:22:34,754 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 32 treesize of output 30 [2018-12-02 01:22:34,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 01:22:34,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 01:22:34,764 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 10 treesize of output 1 [2018-12-02 01:22:34,764 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:34,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:22:34,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:22:34,774 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-12-02 01:22:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:22:34,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:22:34,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-12-02 01:22:34,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 01:22:34,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 01:22:34,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-12-02 01:22:34,834 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 18 states. [2018-12-02 01:22:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:22:36,626 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-12-02 01:22:36,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 01:22:36,626 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-12-02 01:22:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:22:36,627 INFO L225 Difference]: With dead ends: 82 [2018-12-02 01:22:36,627 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 01:22:36,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2018-12-02 01:22:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 01:22:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 46. [2018-12-02 01:22:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 01:22:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-12-02 01:22:36,628 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 36 [2018-12-02 01:22:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:22:36,628 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-12-02 01:22:36,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 01:22:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-12-02 01:22:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 01:22:36,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:22:36,629 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 01:22:36,629 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:22:36,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:22:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash 24619024, now seen corresponding path program 1 times [2018-12-02 01:22:36,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:22:36,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:22:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:22:36,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:22:36,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:22:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:22:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:22:36,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:22:36,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/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 01:22:36,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:22:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:22:36,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:22:36,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 01:22:36,899 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 12 treesize of output 15 [2018-12-02 01:22:36,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:36,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:36,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 01:22:36,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:36,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:36,914 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-02 01:22:36,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 01:22:36,930 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 12 treesize of output 11 [2018-12-02 01:22:36,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:36,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:36,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:36,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-02 01:22:36,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 01:22:36,960 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 13 treesize of output 12 [2018-12-02 01:22:36,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:36,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:22:36,968 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 01:22:36,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-02 01:22:39,238 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-02 01:22:39,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-12-02 01:22:39,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-12-02 01:22:39,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 01:22:39,371 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 34 treesize of output 26 [2018-12-02 01:22:39,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:39,372 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 29 treesize of output 21 [2018-12-02 01:22:39,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:39,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-12-02 01:22:39,411 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 01:22:39,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-12-02 01:22:39,462 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-12-02 01:22:39,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-12-02 01:22:39,541 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-02 01:22:39,616 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 33 treesize of output 26 [2018-12-02 01:22:39,616 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:39,618 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 38 treesize of output 31 [2018-12-02 01:22:39,618 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:39,690 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 26 treesize of output 16 [2018-12-02 01:22:39,690 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:22: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 31 treesize of output 21 [2018-12-02 01:22:39,691 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:39,755 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 34 treesize of output 24 [2018-12-02 01:22:39,755 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:39,756 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 38 treesize of output 28 [2018-12-02 01:22:39,756 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:39,758 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 39 treesize of output 29 [2018-12-02 01:22:39,758 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:22:39,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-02 01:22:39,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 01:22:39,842 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:60, output treesize:86 [2018-12-02 01:22:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:22:39,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:22:39,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2018-12-02 01:22:39,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 01:22:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 01:22:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2018-12-02 01:22:39,956 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 32 states. [2018-12-02 01:22:43,233 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2018-12-02 01:22:50,484 WARN L180 SmtUtils]: Spent 7.11 s on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2018-12-02 01:22:51,613 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2018-12-02 01:22:51,995 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2018-12-02 01:22:54,220 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2018-12-02 01:22:58,076 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2018-12-02 01:23:01,066 WARN L180 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2018-12-02 01:23:01,244 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2018-12-02 01:23:10,987 WARN L180 SmtUtils]: Spent 9.54 s on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2018-12-02 01:23:11,352 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2018-12-02 01:23:16,010 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2018-12-02 01:23:16,323 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2018-12-02 01:23:22,576 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2018-12-02 01:23:22,875 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2018-12-02 01:23:26,588 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-12-02 01:23:28,140 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-02 01:23:29,484 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-12-02 01:23:37,194 WARN L180 SmtUtils]: Spent 4.81 s on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-12-02 01:23:37,711 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2018-12-02 01:23:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:39,429 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-12-02 01:23:39,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-02 01:23:39,430 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-12-02 01:23:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:39,430 INFO L225 Difference]: With dead ends: 90 [2018-12-02 01:23:39,430 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 01:23:39,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=1027, Invalid=4667, Unknown=6, NotChecked=0, Total=5700 [2018-12-02 01:23:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 01:23:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 01:23:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 01:23:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-02 01:23:39,432 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-12-02 01:23:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:39,433 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-02 01:23:39,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 01:23:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-02 01:23:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 01:23:39,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:23:39,433 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:23:39,433 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 01:23:39,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:23:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1307856916, now seen corresponding path program 3 times [2018-12-02 01:23:39,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:23:39,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:23:39,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:39,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:23:39,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:23:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:23:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 01:23:39,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:23:39,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/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 01:23:39,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 01:23:39,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 01:23:39,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:23:39,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:23:39,631 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 9 treesize of output 12 [2018-12-02 01:23:39,643 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 12 treesize of output 15 [2018-12-02 01:23:39,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 01:23:39,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:23:39,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:23:39,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:33 [2018-12-02 01:23:39,683 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 25 treesize of output 22 [2018-12-02 01:23:39,685 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 01:23:39,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:39,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:39,699 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 24 treesize of output 21 [2018-12-02 01:23:39,700 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 12 treesize of output 11 [2018-12-02 01:23:39,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:39,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:39,712 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 2 xjuncts. [2018-12-02 01:23:39,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2018-12-02 01:23:39,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 35 [2018-12-02 01:23:39,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 01:23:39,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:39,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:39,765 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 25 treesize of output 20 [2018-12-02 01:23:39,767 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 20 treesize of output 21 [2018-12-02 01:23:39,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:39,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:23:39,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 01:23:39,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-12-02 01:23:39,884 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 34 treesize of output 34 [2018-12-02 01:23:39,885 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 30 treesize of output 23 [2018-12-02 01:23:39,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:23:39,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-12-02 01:23:39,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-02 01:23:39,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-12-02 01:23:39,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 01:23:39,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-02 01:23:39,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:23:39,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:68 [2018-12-02 01:23:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 01:23:40,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:23:40,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-12-02 01:23:40,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 01:23:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 01:23:40,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-12-02 01:23:40,064 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 24 states. [2018-12-02 01:23:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:23:40,696 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-02 01:23:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 01:23:40,697 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2018-12-02 01:23:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:23:40,697 INFO L225 Difference]: With dead ends: 41 [2018-12-02 01:23:40,697 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 01:23:40,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 01:23:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 01:23:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 01:23:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 01:23:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 01:23:40,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-12-02 01:23:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:23:40,698 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:23:40,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 01:23:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 01:23:40,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 01:23:40,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:23:40 BoogieIcfgContainer [2018-12-02 01:23:40,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:23:40,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:23:40,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:23:40,702 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:23:40,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:20:59" (3/4) ... [2018-12-02 01:23:40,705 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 01:23:40,710 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 01:23:40,710 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 01:23:40,710 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 01:23:40,710 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 01:23:40,710 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure substring [2018-12-02 01:23:40,715 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-02 01:23:40,715 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 01:23:40,715 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 01:23:40,743 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_123fa460-6eee-4854-ae8b-ff1657c84fd0/bin-2019/uautomizer/witness.graphml [2018-12-02 01:23:40,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:23:40,743 INFO L168 Benchmark]: Toolchain (without parser) took 161329.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -270.7 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-02 01:23:40,744 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:23:40,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-02 01:23:40,744 INFO L168 Benchmark]: Boogie Preprocessor took 29.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:23:40,744 INFO L168 Benchmark]: RCFGBuilder took 259.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-12-02 01:23:40,744 INFO L168 Benchmark]: TraceAbstraction took 160736.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-12-02 01:23:40,744 INFO L168 Benchmark]: Witness Printer took 40.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.0 kB). Peak memory consumption was 45.0 kB. Max. memory is 11.5 GB. [2018-12-02 01:23:40,745 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 259.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 160736.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -147.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Witness Printer took 40.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.0 kB). Peak memory consumption was 45.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 15 error locations. SAFE Result, 160.7s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 105.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 649 SDtfs, 2180 SDslu, 2601 SDs, 0 SdLazy, 4436 SolverSat, 387 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 224 SyntacticMatches, 14 SemanticMatches, 433 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 101.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 241 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 54.7s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 811 ConstructedInterpolants, 83 QuantifiedInterpolants, 300558 SizeOfPredicates, 133 NumberOfNonLiveVariables, 1525 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 35/221 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...