./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/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 bbb28681f649db641abcf0a1b656085d04f9cc91 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 03:15:33,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:15:33,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:15:33,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:15:33,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:15:33,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:15:33,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:15:33,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:15:33,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:15:33,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:15:33,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:15:33,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:15:33,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:15:33,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:15:33,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:15:33,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:15:33,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:15:33,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:15:33,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:15:33,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:15:33,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:15:33,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:15:33,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:15:33,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:15:33,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:15:33,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:15:33,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:15:33,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:15:33,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:15:33,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:15:33,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:15:33,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:15:33,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:15:33,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:15:33,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:15:33,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:15:33,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:15:33,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:15:33,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:15:33,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:15:33,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:15:33,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 03:15:33,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:15:33,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:15:33,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:15:33,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:15:33,076 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:15:33,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:15:33,077 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:15:33,077 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 03:15:33,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:15:33,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:15:33,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:15:33,078 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 03:15:33,078 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 03:15:33,078 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 03:15:33,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:15:33,079 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:15:33,079 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:15:33,079 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:15:33,079 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:15:33,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:15:33,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:15:33,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:15:33,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:15:33,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:15:33,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:15:33,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:15:33,081 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 03:15:33,082 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:15:33,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:15:33,082 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/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 -> bbb28681f649db641abcf0a1b656085d04f9cc91 [2019-11-20 03:15:33,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:15:33,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:15:33,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:15:33,266 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:15:33,267 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:15:33,268 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2019-11-20 03:15:33,329 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/data/9763713c0/6bba4bdcc544493d80007d8335baa11c/FLAG87983d88c [2019-11-20 03:15:33,795 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:15:33,796 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2019-11-20 03:15:33,811 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/data/9763713c0/6bba4bdcc544493d80007d8335baa11c/FLAG87983d88c [2019-11-20 03:15:34,154 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/data/9763713c0/6bba4bdcc544493d80007d8335baa11c [2019-11-20 03:15:34,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:15:34,158 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 03:15:34,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:15:34,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:15:34,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:15:34,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:15:34" (1/1) ... [2019-11-20 03:15:34,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a81b648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34, skipping insertion in model container [2019-11-20 03:15:34,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:15:34" (1/1) ... [2019-11-20 03:15:34,184 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:15:34,244 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:15:34,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:15:34,742 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:15:34,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:15:34,871 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:15:34,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34 WrapperNode [2019-11-20 03:15:34,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:15:34,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:15:34,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:15:34,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:15:34,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34" (1/1) ... [2019-11-20 03:15:34,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34" (1/1) ... [2019-11-20 03:15:34,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34" (1/1) ... [2019-11-20 03:15:34,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34" (1/1) ... [2019-11-20 03:15:34,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34" (1/1) ... [2019-11-20 03:15:34,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34" (1/1) ... [2019-11-20 03:15:34,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34" (1/1) ... [2019-11-20 03:15:34,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:15:34,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:15:34,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:15:34,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:15:34,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/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 [2019-11-20 03:15:35,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 03:15:35,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:15:35,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 03:15:35,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 03:15:35,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 03:15:35,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 03:15:35,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 03:15:35,052 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlen [2019-11-20 03:15:35,052 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2019-11-20 03:15:35,054 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrstr [2019-11-20 03:15:35,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 03:15:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 03:15:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 03:15:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 03:15:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 03:15:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 03:15:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 03:15:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 03:15:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 03:15:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 03:15:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 03:15:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 03:15:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 03:15:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 03:15:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 03:15:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 03:15:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 03:15:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 03:15:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 03:15:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 03:15:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 03:15:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 03:15:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 03:15:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 03:15:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 03:15:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 03:15:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 03:15:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 03:15:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 03:15:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 03:15:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 03:15:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 03:15:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 03:15:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 03:15:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 03:15:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 03:15:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 03:15:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 03:15:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 03:15:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 03:15:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 03:15:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 03:15:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 03:15:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 03:15:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 03:15:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 03:15:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 03:15:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 03:15:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 03:15:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 03:15:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 03:15:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 03:15:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 03:15:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 03:15:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 03:15:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 03:15:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 03:15:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 03:15:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 03:15:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 03:15:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 03:15:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 03:15:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 03:15:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 03:15:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 03:15:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 03:15:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 03:15:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 03:15:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 03:15:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 03:15:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 03:15:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 03:15:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 03:15:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 03:15:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 03:15:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 03:15:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 03:15:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 03:15:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 03:15:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 03:15:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 03:15:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 03:15:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 03:15:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 03:15:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 03:15:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 03:15:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 03:15:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 03:15:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 03:15:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 03:15:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 03:15:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 03:15:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 03:15:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 03:15:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 03:15:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 03:15:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 03:15:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 03:15:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 03:15:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 03:15:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 03:15:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 03:15:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 03:15:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 03:15:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 03:15:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 03:15:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 03:15:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 03:15:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 03:15:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-20 03:15:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlen [2019-11-20 03:15:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 03:15:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2019-11-20 03:15:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure cstrstr [2019-11-20 03:15:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 03:15:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:15:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-20 03:15:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:15:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 03:15:35,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:15:35,964 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:15:35,964 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-20 03:15:35,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:15:35 BoogieIcfgContainer [2019-11-20 03:15:35,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:15:35,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:15:35,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:15:35,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:15:35,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:15:34" (1/3) ... [2019-11-20 03:15:35,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b067b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:15:35, skipping insertion in model container [2019-11-20 03:15:35,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:15:34" (2/3) ... [2019-11-20 03:15:35,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b067b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:15:35, skipping insertion in model container [2019-11-20 03:15:35,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:15:35" (3/3) ... [2019-11-20 03:15:35,975 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2019-11-20 03:15:35,993 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:15:36,001 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2019-11-20 03:15:36,013 INFO L249 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2019-11-20 03:15:36,033 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:15:36,033 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 03:15:36,033 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:15:36,033 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:15:36,033 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:15:36,033 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:15:36,033 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:15:36,034 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:15:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-11-20 03:15:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:15:36,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:36,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:36,072 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash -18340179, now seen corresponding path program 1 times [2019-11-20 03:15:36,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:36,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1297613676] [2019-11-20 03:15:36,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:36,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:15:36,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:36,450 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:15:36,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 03:15:36,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:36,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:36,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:15:36,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-20 03:15:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:36,500 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:36,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1297613676] [2019-11-20 03:15:36,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:36,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 03:15:36,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778537990] [2019-11-20 03:15:36,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:15:36,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:36,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:15:36,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:15:36,554 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 4 states. [2019-11-20 03:15:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:36,746 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-11-20 03:15:36,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:15:36,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 03:15:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:36,762 INFO L225 Difference]: With dead ends: 91 [2019-11-20 03:15:36,763 INFO L226 Difference]: Without dead ends: 88 [2019-11-20 03:15:36,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:15:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-20 03:15:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-20 03:15:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 03:15:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2019-11-20 03:15:36,818 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 11 [2019-11-20 03:15:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:36,819 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2019-11-20 03:15:36,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:15:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2019-11-20 03:15:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:15:36,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:36,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:37,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:37,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:37,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash -18340178, now seen corresponding path program 1 times [2019-11-20 03:15:37,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:37,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1102947892] [2019-11-20 03:15:37,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:37,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:15:37,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:37,247 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_44|]} [2019-11-20 03:15:37,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:15:37,256 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:15:37,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:37,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:37,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 03:15:37,286 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:37,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:37,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:15:37,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-20 03:15:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:37,337 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:37,438 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:15:37,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 03:15:37,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:37,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:37,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:15:37,470 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:37,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:37,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:15:37,485 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-11-20 03:15:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:37,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1102947892] [2019-11-20 03:15:37,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:37,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 03:15:37,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016533278] [2019-11-20 03:15:37,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:15:37,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:37,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:15:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:15:37,524 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 6 states. [2019-11-20 03:15:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:38,415 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2019-11-20 03:15:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:15:38,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-20 03:15:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:38,421 INFO L225 Difference]: With dead ends: 133 [2019-11-20 03:15:38,421 INFO L226 Difference]: Without dead ends: 133 [2019-11-20 03:15:38,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:15:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-20 03:15:38,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 93. [2019-11-20 03:15:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 03:15:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-11-20 03:15:38,437 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 11 [2019-11-20 03:15:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:38,437 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-11-20 03:15:38,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:15:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-11-20 03:15:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 03:15:38,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:38,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:38,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:38,642 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:38,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1329915707, now seen corresponding path program 1 times [2019-11-20 03:15:38,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:38,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [760514896] [2019-11-20 03:15:38,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:38,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:15:38,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:38,838 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:38,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [760514896] [2019-11-20 03:15:38,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:38,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-11-20 03:15:38,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891709593] [2019-11-20 03:15:38,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:15:38,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:38,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:15:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:15:38,859 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 5 states. [2019-11-20 03:15:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:38,968 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2019-11-20 03:15:38,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:15:38,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-20 03:15:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:38,970 INFO L225 Difference]: With dead ends: 95 [2019-11-20 03:15:38,970 INFO L226 Difference]: Without dead ends: 95 [2019-11-20 03:15:38,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:15:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-20 03:15:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-11-20 03:15:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-20 03:15:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2019-11-20 03:15:38,981 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 13 [2019-11-20 03:15:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:38,981 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2019-11-20 03:15:38,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:15:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2019-11-20 03:15:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:15:38,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:38,982 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:39,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:39,187 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1812167729, now seen corresponding path program 1 times [2019-11-20 03:15:39,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:39,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1231238303] [2019-11-20 03:15:39,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:39,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:15:39,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:39,433 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:39,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1231238303] [2019-11-20 03:15:39,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:15:39,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 03:15:39,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200564328] [2019-11-20 03:15:39,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:15:39,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:39,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:15:39,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:15:39,496 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 8 states. [2019-11-20 03:15:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:39,684 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-11-20 03:15:39,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:15:39,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-20 03:15:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:39,689 INFO L225 Difference]: With dead ends: 113 [2019-11-20 03:15:39,689 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 03:15:39,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:15:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 03:15:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2019-11-20 03:15:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-20 03:15:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2019-11-20 03:15:39,697 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 15 [2019-11-20 03:15:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:39,698 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2019-11-20 03:15:39,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:15:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2019-11-20 03:15:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:15:39,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:39,699 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:39,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:39,909 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:39,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1802741197, now seen corresponding path program 1 times [2019-11-20 03:15:39,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:39,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1704902964] [2019-11-20 03:15:39,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:40,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 03:15:40,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:40,098 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 1=[|v_#valid_57|]} [2019-11-20 03:15:40,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:15:40,106 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:15:40,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:40,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:40,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 03:15:40,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:40,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:40,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:15:40,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-20 03:15:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:40,248 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:40,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1704902964] [2019-11-20 03:15:40,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:15:40,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-20 03:15:40,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326542036] [2019-11-20 03:15:40,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:15:40,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:15:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:15:40,657 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 10 states. [2019-11-20 03:15:41,003 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 03:15:41,397 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-11-20 03:15:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:42,169 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2019-11-20 03:15:42,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:15:42,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-20 03:15:42,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:42,171 INFO L225 Difference]: With dead ends: 140 [2019-11-20 03:15:42,171 INFO L226 Difference]: Without dead ends: 140 [2019-11-20 03:15:42,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-20 03:15:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-20 03:15:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 115. [2019-11-20 03:15:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-20 03:15:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2019-11-20 03:15:42,180 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 15 [2019-11-20 03:15:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:42,180 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2019-11-20 03:15:42,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:15:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2019-11-20 03:15:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:15:42,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:42,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:42,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:42,384 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2031382908, now seen corresponding path program 1 times [2019-11-20 03:15:42,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:42,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [382286709] [2019-11-20 03:15:42,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:42,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:15:42,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:42,575 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:15:42,575 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:15:42,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:42,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:42,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:15:42,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 03:15:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:42,596 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:42,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [382286709] [2019-11-20 03:15:42,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:42,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 03:15:42,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030024508] [2019-11-20 03:15:42,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:15:42,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:15:42,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:15:42,621 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 4 states. [2019-11-20 03:15:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:42,736 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2019-11-20 03:15:42,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:15:42,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-20 03:15:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:42,738 INFO L225 Difference]: With dead ends: 113 [2019-11-20 03:15:42,738 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 03:15:42,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:15:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 03:15:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-20 03:15:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-20 03:15:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-11-20 03:15:42,746 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 17 [2019-11-20 03:15:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:42,746 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-11-20 03:15:42,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:15:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-11-20 03:15:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:15:42,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:42,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:42,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:42,950 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2031382909, now seen corresponding path program 1 times [2019-11-20 03:15:42,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:42,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [560339085] [2019-11-20 03:15:42,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:43,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:15:43,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:43,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:43,133 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:15:43,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:43,155 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 03:15:43,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:15:43,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-20 03:15:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:43,176 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:43,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [560339085] [2019-11-20 03:15:43,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:43,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 03:15:43,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852626578] [2019-11-20 03:15:43,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:15:43,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:43,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:15:43,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:15:43,307 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 8 states. [2019-11-20 03:15:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:43,976 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2019-11-20 03:15:43,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:15:43,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-20 03:15:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:43,979 INFO L225 Difference]: With dead ends: 175 [2019-11-20 03:15:43,979 INFO L226 Difference]: Without dead ends: 175 [2019-11-20 03:15:43,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:15:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-20 03:15:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2019-11-20 03:15:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-20 03:15:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2019-11-20 03:15:43,990 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 17 [2019-11-20 03:15:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:43,990 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2019-11-20 03:15:43,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:15:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2019-11-20 03:15:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:15:43,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:43,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:44,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:44,206 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:44,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash -750576277, now seen corresponding path program 1 times [2019-11-20 03:15:44,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:44,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [668980089] [2019-11-20 03:15:44,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:44,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:15:44,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:44,432 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:44,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [668980089] [2019-11-20 03:15:44,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:44,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-11-20 03:15:44,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192399966] [2019-11-20 03:15:44,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:15:44,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:15:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:15:44,465 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand 5 states. [2019-11-20 03:15:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:44,556 INFO L93 Difference]: Finished difference Result 167 states and 195 transitions. [2019-11-20 03:15:44,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:15:44,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 03:15:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:44,559 INFO L225 Difference]: With dead ends: 167 [2019-11-20 03:15:44,559 INFO L226 Difference]: Without dead ends: 167 [2019-11-20 03:15:44,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:15:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-20 03:15:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2019-11-20 03:15:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-20 03:15:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2019-11-20 03:15:44,571 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 18 [2019-11-20 03:15:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:44,571 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2019-11-20 03:15:44,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:15:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2019-11-20 03:15:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:15:44,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:44,572 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:44,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:44,773 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:44,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:44,773 INFO L82 PathProgramCache]: Analyzing trace with hash 241712128, now seen corresponding path program 1 times [2019-11-20 03:15:44,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:44,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2043092651] [2019-11-20 03:15:44,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:44,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:15:44,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:44,969 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:45,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2043092651] [2019-11-20 03:15:45,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:15:45,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 03:15:45,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477513100] [2019-11-20 03:15:45,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:15:45,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:45,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:15:45,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:15:45,007 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand 8 states. [2019-11-20 03:15:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:45,120 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2019-11-20 03:15:45,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:15:45,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-20 03:15:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:45,124 INFO L225 Difference]: With dead ends: 163 [2019-11-20 03:15:45,124 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 03:15:45,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:15:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 03:15:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2019-11-20 03:15:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-20 03:15:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-11-20 03:15:45,142 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 21 [2019-11-20 03:15:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:45,142 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-11-20 03:15:45,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:15:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-11-20 03:15:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:15:45,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:45,147 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:45,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:45,351 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:45,351 INFO L82 PathProgramCache]: Analyzing trace with hash -769405122, now seen corresponding path program 1 times [2019-11-20 03:15:45,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:45,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1093068076] [2019-11-20 03:15:45,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:45,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 03:15:45,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:45,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:45,559 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:15:45,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:45,583 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 03:15:45,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:15:45,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-20 03:15:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:45,701 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:46,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1093068076] [2019-11-20 03:15:46,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:15:46,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-20 03:15:46,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444313202] [2019-11-20 03:15:46,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:15:46,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:15:46,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:15:46,138 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 12 states. [2019-11-20 03:15:46,614 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-11-20 03:15:46,773 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2019-11-20 03:15:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:47,694 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2019-11-20 03:15:47,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:15:47,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-20 03:15:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:47,696 INFO L225 Difference]: With dead ends: 187 [2019-11-20 03:15:47,696 INFO L226 Difference]: Without dead ends: 187 [2019-11-20 03:15:47,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-11-20 03:15:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-20 03:15:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2019-11-20 03:15:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-20 03:15:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2019-11-20 03:15:47,703 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 21 [2019-11-20 03:15:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:47,703 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2019-11-20 03:15:47,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:15:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2019-11-20 03:15:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:15:47,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:47,705 INFO L410 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] [2019-11-20 03:15:47,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:47,913 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash -451440385, now seen corresponding path program 1 times [2019-11-20 03:15:47,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:47,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [564225616] [2019-11-20 03:15:47,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:48,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:15:48,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:48,120 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:15:48,120 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:15:48,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:48,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:48,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:15:48,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 03:15:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:15:48,163 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:48,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [564225616] [2019-11-20 03:15:48,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:48,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 5 [2019-11-20 03:15:48,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221682182] [2019-11-20 03:15:48,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:15:48,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:48,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:15:48,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:15:48,198 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 6 states. [2019-11-20 03:15:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:48,389 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2019-11-20 03:15:48,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:15:48,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-20 03:15:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:48,390 INFO L225 Difference]: With dead ends: 161 [2019-11-20 03:15:48,390 INFO L226 Difference]: Without dead ends: 161 [2019-11-20 03:15:48,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:15:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-20 03:15:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-11-20 03:15:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-20 03:15:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-11-20 03:15:48,395 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 25 [2019-11-20 03:15:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:48,396 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-11-20 03:15:48,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:15:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-11-20 03:15:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:15:48,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:48,397 INFO L410 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] [2019-11-20 03:15:48,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:48,600 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:48,600 INFO L82 PathProgramCache]: Analyzing trace with hash -451440384, now seen corresponding path program 1 times [2019-11-20 03:15:48,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:48,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [437666091] [2019-11-20 03:15:48,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:48,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 03:15:48,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:48,812 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:48,812 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:15:48,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:48,835 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 03:15:48,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:15:48,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-20 03:15:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:15:48,876 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:15:49,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [437666091] [2019-11-20 03:15:49,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:15:49,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 03:15:49,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689269938] [2019-11-20 03:15:49,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:15:49,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:49,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:15:49,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:15:49,041 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 10 states. [2019-11-20 03:15:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:49,707 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2019-11-20 03:15:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:15:49,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-20 03:15:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:49,709 INFO L225 Difference]: With dead ends: 189 [2019-11-20 03:15:49,709 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 03:15:49,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:15:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 03:15:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 160. [2019-11-20 03:15:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-20 03:15:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 185 transitions. [2019-11-20 03:15:49,715 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 185 transitions. Word has length 25 [2019-11-20 03:15:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:49,716 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 185 transitions. [2019-11-20 03:15:49,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:15:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 185 transitions. [2019-11-20 03:15:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 03:15:49,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:49,717 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:49,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:49,920 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:49,921 INFO L82 PathProgramCache]: Analyzing trace with hash -780563184, now seen corresponding path program 1 times [2019-11-20 03:15:49,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:49,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1347502802] [2019-11-20 03:15:49,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:50,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 03:15:50,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:50,535 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:51,489 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-11-20 03:15:51,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2019-11-20 03:15:51,737 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:15:51,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-11-20 03:15:51,780 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:15:52,197 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-11-20 03:15:52,197 INFO L567 ElimStorePlain]: treesize reduction 14, result has 79.1 percent of original size [2019-11-20 03:15:52,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 03:15:52,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:53 [2019-11-20 03:15:52,568 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 19 [2019-11-20 03:15:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:52,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1347502802] [2019-11-20 03:15:52,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:15:52,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-20 03:15:52,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906712684] [2019-11-20 03:15:52,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 03:15:52,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:52,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 03:15:52,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-20 03:15:52,582 INFO L87 Difference]: Start difference. First operand 160 states and 185 transitions. Second operand 17 states. [2019-11-20 03:15:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:54,647 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2019-11-20 03:15:54,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:15:54,649 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-11-20 03:15:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:54,651 INFO L225 Difference]: With dead ends: 191 [2019-11-20 03:15:54,651 INFO L226 Difference]: Without dead ends: 191 [2019-11-20 03:15:54,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2019-11-20 03:15:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-20 03:15:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 141. [2019-11-20 03:15:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 03:15:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-11-20 03:15:54,658 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 25 [2019-11-20 03:15:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:54,658 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-11-20 03:15:54,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 03:15:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-11-20 03:15:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 03:15:54,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:54,660 INFO L410 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] [2019-11-20 03:15:54,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:54,863 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:54,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1292283739, now seen corresponding path program 1 times [2019-11-20 03:15:54,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:54,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [144321225] [2019-11-20 03:15:54,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:15:55,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:15:55,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:55,106 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:55,106 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:15:55,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:55,144 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 03:15:55,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:15:55,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 03:15:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:55,318 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:15:56,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [144321225] [2019-11-20 03:15:56,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:15:56,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-20 03:15:56,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526384168] [2019-11-20 03:15:56,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 03:15:56,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:56,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 03:15:56,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-11-20 03:15:56,190 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 16 states. [2019-11-20 03:15:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:15:57,446 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2019-11-20 03:15:57,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:15:57,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-20 03:15:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:15:57,449 INFO L225 Difference]: With dead ends: 157 [2019-11-20 03:15:57,449 INFO L226 Difference]: Without dead ends: 157 [2019-11-20 03:15:57,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-11-20 03:15:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-20 03:15:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 134. [2019-11-20 03:15:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-20 03:15:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2019-11-20 03:15:57,455 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 26 [2019-11-20 03:15:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:15:57,456 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2019-11-20 03:15:57,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 03:15:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2019-11-20 03:15:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 03:15:57,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:15:57,457 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:15:57,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:57,658 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:15:57,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:15:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2036363588, now seen corresponding path program 2 times [2019-11-20 03:15:57,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:15:57,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1547023880] [2019-11-20 03:15:57,658 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:15:57,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:15:57,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:15:57,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 03:15:57,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:15:57,884 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_50|], 1=[|v_#valid_100|]} [2019-11-20 03:15:57,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:15:57,899 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:15:57,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:57,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:57,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 03:15:57,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:57,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:57,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:15:57,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-20 03:15:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:58,155 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:15:59,182 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 03:15:59,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:15:59,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:15:59,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:15:59,188 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 03:15:59,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:15:59,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:1 [2019-11-20 03:15:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:15:59,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1547023880] [2019-11-20 03:15:59,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:15:59,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-20 03:15:59,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410877909] [2019-11-20 03:15:59,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 03:15:59,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:15:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 03:15:59,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-11-20 03:15:59,195 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 17 states. [2019-11-20 03:16:01,011 WARN L191 SmtUtils]: Spent 906.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 03:16:02,549 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-20 03:16:05,336 WARN L191 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 03:16:06,434 WARN L191 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-20 03:16:07,090 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 03:16:07,898 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-20 03:16:08,331 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 03:16:08,880 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-11-20 03:16:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:16:10,537 INFO L93 Difference]: Finished difference Result 326 states and 367 transitions. [2019-11-20 03:16:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 03:16:10,540 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-11-20 03:16:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:16:10,542 INFO L225 Difference]: With dead ends: 326 [2019-11-20 03:16:10,542 INFO L226 Difference]: Without dead ends: 326 [2019-11-20 03:16:10,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=289, Invalid=581, Unknown=0, NotChecked=0, Total=870 [2019-11-20 03:16:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-20 03:16:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 182. [2019-11-20 03:16:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-20 03:16:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2019-11-20 03:16:10,551 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 27 [2019-11-20 03:16:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:16:10,552 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2019-11-20 03:16:10,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 03:16:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2019-11-20 03:16:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 03:16:10,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:16:10,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:16:10,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:10,754 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:16:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:16:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash 489096609, now seen corresponding path program 1 times [2019-11-20 03:16:10,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:16:10,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1352719740] [2019-11-20 03:16:10,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:16:10,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 03:16:10,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:16:10,994 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:16:10,994 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 03:16:10,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:11,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:11,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:16:11,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 03:16:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:16:11,048 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:16:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:16:11,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1352719740] [2019-11-20 03:16:11,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:16:11,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 7 [2019-11-20 03:16:11,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840578991] [2019-11-20 03:16:11,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:16:11,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:16:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:16:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:16:11,102 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand 8 states. [2019-11-20 03:16:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:16:11,335 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2019-11-20 03:16:11,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:16:11,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-20 03:16:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:16:11,336 INFO L225 Difference]: With dead ends: 181 [2019-11-20 03:16:11,336 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 03:16:11,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:16:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 03:16:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-11-20 03:16:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-20 03:16:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2019-11-20 03:16:11,341 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 30 [2019-11-20 03:16:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:16:11,341 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2019-11-20 03:16:11,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:16:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2019-11-20 03:16:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 03:16:11,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:16:11,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:16:11,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:11,546 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:16:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:16:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash 489096610, now seen corresponding path program 1 times [2019-11-20 03:16:11,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:16:11,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [142957344] [2019-11-20 03:16:11,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:16:11,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:16:11,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:16:11,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 8 [2019-11-20 03:16:11,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:11,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:11,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:11,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-20 03:16:11,811 INFO L377 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 17 treesize of output 9 [2019-11-20 03:16:11,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:11,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:11,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:11,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 03:16:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:16:11,839 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:16:11,928 INFO L377 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 17 treesize of output 15 [2019-11-20 03:16:11,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 03:16:11,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:11,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:11,935 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:11,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:11,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:11,937 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-20 03:16:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:16:11,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [142957344] [2019-11-20 03:16:11,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:16:11,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 12 [2019-11-20 03:16:11,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990029607] [2019-11-20 03:16:11,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:16:11,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:16:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:16:11,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:16:11,947 INFO L87 Difference]: Start difference. First operand 181 states and 214 transitions. Second operand 12 states. [2019-11-20 03:16:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:16:12,253 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2019-11-20 03:16:12,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:16:12,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-11-20 03:16:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:16:12,258 INFO L225 Difference]: With dead ends: 198 [2019-11-20 03:16:12,258 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 03:16:12,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-20 03:16:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 03:16:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2019-11-20 03:16:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-20 03:16:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 224 transitions. [2019-11-20 03:16:12,265 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 224 transitions. Word has length 30 [2019-11-20 03:16:12,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:16:12,265 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 224 transitions. [2019-11-20 03:16:12,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:16:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 224 transitions. [2019-11-20 03:16:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 03:16:12,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:16:12,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:16:12,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:12,470 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:16:12,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:16:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1316341724, now seen corresponding path program 1 times [2019-11-20 03:16:12,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:16:12,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [518589832] [2019-11-20 03:16:12,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:16:12,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 03:16:12,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:16:12,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-20 03:16:12,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:12,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:12,767 INFO L496 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. [2019-11-20 03:16:12,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-20 03:16:12,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:16:12,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:12,886 INFO L377 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 19 treesize of output 12 [2019-11-20 03:16:12,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:12,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:12,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:12,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2019-11-20 03:16:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:16:12,936 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:16:13,035 INFO L377 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 17 treesize of output 15 [2019-11-20 03:16:13,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 03:16:13,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:13,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:13,041 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:13,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:13,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:13,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-20 03:16:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:16:13,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [518589832] [2019-11-20 03:16:13,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:16:13,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2019-11-20 03:16:13,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208545238] [2019-11-20 03:16:13,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 03:16:13,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:16:13,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 03:16:13,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-20 03:16:13,157 INFO L87 Difference]: Start difference. First operand 191 states and 224 transitions. Second operand 18 states. [2019-11-20 03:16:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:16:13,957 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2019-11-20 03:16:13,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 03:16:13,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-20 03:16:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:16:13,972 INFO L225 Difference]: With dead ends: 215 [2019-11-20 03:16:13,972 INFO L226 Difference]: Without dead ends: 215 [2019-11-20 03:16:13,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2019-11-20 03:16:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-20 03:16:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2019-11-20 03:16:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-20 03:16:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 229 transitions. [2019-11-20 03:16:13,983 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 229 transitions. Word has length 30 [2019-11-20 03:16:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:16:13,984 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 229 transitions. [2019-11-20 03:16:13,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 03:16:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 229 transitions. [2019-11-20 03:16:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 03:16:13,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:16:13,986 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:16:14,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:14,190 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:16:14,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:16:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1464025700, now seen corresponding path program 1 times [2019-11-20 03:16:14,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:16:14,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1178678467] [2019-11-20 03:16:14,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:16:14,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 03:16:14,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:16:14,427 INFO L377 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 6 treesize of output 5 [2019-11-20 03:16:14,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:14,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:14,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:14,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 03:16:14,525 INFO L343 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2019-11-20 03:16:14,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 49 [2019-11-20 03:16:14,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:14,548 INFO L567 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2019-11-20 03:16:14,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:14,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 03:16:14,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-11-20 03:16:14,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:14,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:14,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:14,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:14,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:14,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:14,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:14,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:16:16,723 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:16:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 03:16:22,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1178678467] [2019-11-20 03:16:22,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:16:22,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-11-20 03:16:22,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115125752] [2019-11-20 03:16:22,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:16:22,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:16:22,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:16:22,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=59, Unknown=4, NotChecked=0, Total=90 [2019-11-20 03:16:22,820 INFO L87 Difference]: Start difference. First operand 195 states and 229 transitions. Second operand 10 states. [2019-11-20 03:16:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:16:39,402 INFO L93 Difference]: Finished difference Result 194 states and 228 transitions. [2019-11-20 03:16:39,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:16:39,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-20 03:16:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:16:39,403 INFO L225 Difference]: With dead ends: 194 [2019-11-20 03:16:39,403 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 03:16:39,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=40, Invalid=88, Unknown=4, NotChecked=0, Total=132 [2019-11-20 03:16:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 03:16:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-11-20 03:16:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-20 03:16:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2019-11-20 03:16:39,409 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 32 [2019-11-20 03:16:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:16:39,409 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2019-11-20 03:16:39,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:16:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2019-11-20 03:16:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:16:39,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:16:39,410 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:16:39,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:39,610 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:16:39,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:16:39,611 INFO L82 PathProgramCache]: Analyzing trace with hash 250333569, now seen corresponding path program 2 times [2019-11-20 03:16:39,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:16:39,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1708453399] [2019-11-20 03:16:39,612 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:39,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 03:16:39,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:16:39,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 03:16:39,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:16:39,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:39,837 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:16:39,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:39,895 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 03:16:39,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:39,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 03:16:39,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2019-11-20 03:16:39,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:39,967 INFO L567 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2019-11-20 03:16:39,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:39,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2019-11-20 03:16:40,163 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:40,164 INFO L377 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 23 treesize of output 23 [2019-11-20 03:16:40,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:40,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:40,166 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:16:40,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:40,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:40,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:16:40,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:29 [2019-11-20 03:16:40,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:40,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:40,677 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-11-20 03:16:40,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:16:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 03:16:41,041 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:16:42,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-11-20 03:16:42,018 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:16:42,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:16:42,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-20 03:16:42,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:42,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:42,064 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:42,080 INFO L377 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 40 treesize of output 38 [2019-11-20 03:16:42,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-20 03:16:42,113 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-20 03:16:42,189 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-20 03:16:42,189 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:42,210 INFO L377 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 40 treesize of output 38 [2019-11-20 03:16:42,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-20 03:16:42,258 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-20 03:16:42,355 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-20 03:16:42,355 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:42,481 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-20 03:16:42,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:42,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 03:16:42,482 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:119, output treesize:83 [2019-11-20 03:16:42,834 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-20 03:16:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 03:16:42,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1708453399] [2019-11-20 03:16:42,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:16:42,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 20 [2019-11-20 03:16:42,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476701713] [2019-11-20 03:16:42,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 03:16:42,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:16:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 03:16:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-20 03:16:42,867 INFO L87 Difference]: Start difference. First operand 166 states and 186 transitions. Second operand 21 states. [2019-11-20 03:16:43,309 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-20 03:16:44,168 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-20 03:16:44,465 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-20 03:16:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:16:46,069 INFO L93 Difference]: Finished difference Result 172 states and 193 transitions. [2019-11-20 03:16:46,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 03:16:46,070 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-20 03:16:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:16:46,071 INFO L225 Difference]: With dead ends: 172 [2019-11-20 03:16:46,071 INFO L226 Difference]: Without dead ends: 172 [2019-11-20 03:16:46,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2019-11-20 03:16:46,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-20 03:16:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2019-11-20 03:16:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-20 03:16:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2019-11-20 03:16:46,075 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 34 [2019-11-20 03:16:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:16:46,076 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2019-11-20 03:16:46,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 03:16:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2019-11-20 03:16:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 03:16:46,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:16:46,077 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:16:46,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:46,280 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:16:46,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:16:46,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1624194809, now seen corresponding path program 1 times [2019-11-20 03:16:46,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:16:46,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1350907004] [2019-11-20 03:16:46,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:16:46,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 03:16:46,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:16:46,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-20 03:16:46,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:46,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:46,674 INFO L496 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. [2019-11-20 03:16:46,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2019-11-20 03:16:46,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:16:46,868 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:46,868 INFO L377 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 19 treesize of output 12 [2019-11-20 03:16:46,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:46,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:46,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:46,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:5 [2019-11-20 03:16:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:16:46,904 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:16:47,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-11-20 03:16:47,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-11-20 03:16:47,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:47,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:47,209 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:47,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:47,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:47,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2019-11-20 03:16:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:16:47,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1350907004] [2019-11-20 03:16:47,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:16:47,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-20 03:16:47,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083016583] [2019-11-20 03:16:47,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 03:16:47,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:16:47,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 03:16:47,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2019-11-20 03:16:47,644 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 25 states. [2019-11-20 03:16:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:16:49,099 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2019-11-20 03:16:49,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 03:16:49,100 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-11-20 03:16:49,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:16:49,102 INFO L225 Difference]: With dead ends: 199 [2019-11-20 03:16:49,102 INFO L226 Difference]: Without dead ends: 199 [2019-11-20 03:16:49,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2019-11-20 03:16:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-20 03:16:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 185. [2019-11-20 03:16:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-20 03:16:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2019-11-20 03:16:49,108 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 37 [2019-11-20 03:16:49,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:16:49,108 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2019-11-20 03:16:49,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 03:16:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2019-11-20 03:16:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 03:16:49,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:16:49,109 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:16:49,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:49,310 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:16:49,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:16:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1417291012, now seen corresponding path program 2 times [2019-11-20 03:16:49,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:16:49,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2080440460] [2019-11-20 03:16:49,311 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:49,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:16:49,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:16:49,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 03:16:49,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:16:49,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:49,776 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:16:49,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:49,844 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 03:16:49,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:49,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 03:16:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:16:50,371 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:16:52,805 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-20 03:16:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:16:53,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2080440460] [2019-11-20 03:16:53,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:16:53,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2019-11-20 03:16:53,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747874242] [2019-11-20 03:16:53,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-20 03:16:53,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:16:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-20 03:16:53,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2019-11-20 03:16:53,083 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand 31 states. [2019-11-20 03:16:55,561 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 03:16:57,097 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-11-20 03:16:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:16:59,307 INFO L93 Difference]: Finished difference Result 248 states and 278 transitions. [2019-11-20 03:16:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 03:16:59,309 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2019-11-20 03:16:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:16:59,311 INFO L225 Difference]: With dead ends: 248 [2019-11-20 03:16:59,311 INFO L226 Difference]: Without dead ends: 248 [2019-11-20 03:16:59,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=248, Invalid=1644, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 03:16:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-20 03:16:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 188. [2019-11-20 03:16:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-20 03:16:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2019-11-20 03:16:59,317 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 41 [2019-11-20 03:16:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:16:59,318 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2019-11-20 03:16:59,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-20 03:16:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2019-11-20 03:16:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 03:16:59,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:16:59,319 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:16:59,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:59,520 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:16:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:16:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1622899909, now seen corresponding path program 1 times [2019-11-20 03:16:59,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:16:59,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2089753278] [2019-11-20 03:16:59,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:16:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:16:59,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:16:59,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:16:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 03:16:59,851 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:16:59,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-20 03:16:59,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:16:59,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:16:59,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:16:59,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-20 03:16:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 03:16:59,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2089753278] [2019-11-20 03:16:59,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:16:59,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2019-11-20 03:16:59,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346712021] [2019-11-20 03:16:59,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:16:59,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:16:59,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:16:59,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:16:59,877 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand 7 states. [2019-11-20 03:17:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:17:00,090 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2019-11-20 03:17:00,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:17:00,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-20 03:17:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:17:00,091 INFO L225 Difference]: With dead ends: 187 [2019-11-20 03:17:00,091 INFO L226 Difference]: Without dead ends: 187 [2019-11-20 03:17:00,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:17:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-20 03:17:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-11-20 03:17:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-20 03:17:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 209 transitions. [2019-11-20 03:17:00,096 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 209 transitions. Word has length 42 [2019-11-20 03:17:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:17:00,097 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 209 transitions. [2019-11-20 03:17:00,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:17:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2019-11-20 03:17:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 03:17:00,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:17:00,098 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:17:00,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:17:00,302 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:17:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:17:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1622899910, now seen corresponding path program 1 times [2019-11-20 03:17:00,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:17:00,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1351336245] [2019-11-20 03:17:00,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:17:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:17:00,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:17:00,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:17:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 03:17:00,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:17:01,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:17:01,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2019-11-20 03:17:01,035 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:17:01,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-11-20 03:17:01,049 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:17:01,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-20 03:17:01,060 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:17:01,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:17:01,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 03:17:01,117 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2019-11-20 03:17:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 03:17:01,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1351336245] [2019-11-20 03:17:01,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:17:01,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2019-11-20 03:17:01,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967807698] [2019-11-20 03:17:01,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 03:17:01,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:17:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 03:17:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-20 03:17:01,266 INFO L87 Difference]: Start difference. First operand 187 states and 209 transitions. Second operand 13 states. [2019-11-20 03:17:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:17:02,477 INFO L93 Difference]: Finished difference Result 212 states and 236 transitions. [2019-11-20 03:17:02,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:17:02,479 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2019-11-20 03:17:02,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:17:02,480 INFO L225 Difference]: With dead ends: 212 [2019-11-20 03:17:02,481 INFO L226 Difference]: Without dead ends: 212 [2019-11-20 03:17:02,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-11-20 03:17:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-20 03:17:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 190. [2019-11-20 03:17:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-20 03:17:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2019-11-20 03:17:02,486 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 42 [2019-11-20 03:17:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:17:02,487 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2019-11-20 03:17:02,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 03:17:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2019-11-20 03:17:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 03:17:02,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:17:02,488 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:17:02,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:17:02,692 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:17:02,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:17:02,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1307015070, now seen corresponding path program 3 times [2019-11-20 03:17:02,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:17:02,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1483700162] [2019-11-20 03:17:02,693 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:17:03,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 03:17:03,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:17:03,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 03:17:03,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:17:03,087 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:17:03,087 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 03:17:03,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:17:03,125 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 03:17:03,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:17:03,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 03:17:03,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2019-11-20 03:17:03,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:17:03,201 INFO L567 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2019-11-20 03:17:03,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:17:03,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2019-11-20 03:17:03,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:17:03,659 INFO L377 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 21 treesize of output 21 [2019-11-20 03:17:03,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:03,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:03,660 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:17:03,699 INFO L567 ElimStorePlain]: treesize reduction 5, result has 85.7 percent of original size [2019-11-20 03:17:03,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:03,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:17:03,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2019-11-20 03:17:03,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:03,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 03:17:04,109 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:17:06,316 INFO L377 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 67 treesize of output 65 [2019-11-20 03:17:06,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2019-11-20 03:17:06,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 03:17:06,561 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-11-20 03:17:06,561 INFO L567 ElimStorePlain]: treesize reduction 6, result has 90.6 percent of original size [2019-11-20 03:17:06,562 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:17:06,576 INFO L377 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 65 treesize of output 63 [2019-11-20 03:17:06,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:17:06,590 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:17:06,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-11-20 03:17:06,600 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:17:06,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:17:06,654 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:17:06,687 INFO L377 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 67 treesize of output 65 [2019-11-20 03:17:06,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2019-11-20 03:17:06,752 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-20 03:17:06,913 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2019-11-20 03:17:06,914 INFO L567 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-11-20 03:17:06,914 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:17:07,354 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-20 03:17:07,354 INFO L567 ElimStorePlain]: treesize reduction 18, result has 89.1 percent of original size [2019-11-20 03:17:07,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 03:17:07,354 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:200, output treesize:147 [2019-11-20 03:17:07,890 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 03:17:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 03:17:07,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1483700162] [2019-11-20 03:17:07,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:17:07,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-20 03:17:07,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11050743] [2019-11-20 03:17:07,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 03:17:07,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:17:07,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 03:17:07,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-11-20 03:17:07,925 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand 27 states. [2019-11-20 03:17:10,486 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-11-20 03:17:10,924 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-20 03:17:11,348 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-11-20 03:17:12,830 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-11-20 03:17:13,247 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-20 03:17:13,668 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-20 03:17:14,222 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-20 03:17:14,883 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-20 03:17:15,396 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-11-20 03:17:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:17:16,679 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2019-11-20 03:17:16,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 03:17:16,680 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2019-11-20 03:17:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:17:16,682 INFO L225 Difference]: With dead ends: 211 [2019-11-20 03:17:16,682 INFO L226 Difference]: Without dead ends: 211 [2019-11-20 03:17:16,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=282, Invalid=1610, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 03:17:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-20 03:17:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 199. [2019-11-20 03:17:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-20 03:17:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 224 transitions. [2019-11-20 03:17:16,688 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 224 transitions. Word has length 44 [2019-11-20 03:17:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:17:16,688 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 224 transitions. [2019-11-20 03:17:16,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 03:17:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 224 transitions. [2019-11-20 03:17:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 03:17:16,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:17:16,689 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:17:16,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:17:16,893 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrstrErr1REQUIRES_VIOLATION, cstrstrErr0REQUIRES_VIOLATION, cstrstrErr2REQUIRES_VIOLATION, cstrstrErr3REQUIRES_VIOLATION]=== [2019-11-20 03:17:16,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:17:16,893 INFO L82 PathProgramCache]: Analyzing trace with hash -989565473, now seen corresponding path program 1 times [2019-11-20 03:17:16,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:17:16,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [358556271] [2019-11-20 03:17:16,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00cb1f4a-ad2f-4be1-a5c0-f49b0dcef9ab/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:17:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:17:17,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 03:17:17,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:17:17,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 03:17:17,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:17:17,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:17:17,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:17:17,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-20 03:17:17,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 8 [2019-11-20 03:17:17,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:17:17,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:17:17,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:17:17,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-20 03:17:17,541 INFO L377 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 24 treesize of output 23 [2019-11-20 03:17:17,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:17:17,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:17:17,565 INFO L496 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. [2019-11-20 03:17:17,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2019-11-20 03:17:18,249 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:17:18,250 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2019-11-20 03:17:18,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:17:18,277 INFO L567 ElimStorePlain]: treesize reduction 5, result has 77.3 percent of original size [2019-11-20 03:17:18,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:17:18,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:5 [2019-11-20 03:17:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:17:18,433 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:17:18,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,327 WARN L191 SmtUtils]: Spent 6.08 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-20 03:17:25,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:17:25,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 107 [2019-11-20 03:17:25,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,360 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:17:25,360 INFO L377 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 89 treesize of output 89 [2019-11-20 03:17:25,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:17:25,372 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:17:25,376 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_47], 1=[v_arrayElimCell_48]} [2019-11-20 03:17:25,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:17:25,583 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 03:17:25,589 INFO L168 Benchmark]: Toolchain (without parser) took 111431.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -205.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:17:25,589 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:17:25,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:17:25,590 INFO L168 Benchmark]: Boogie Preprocessor took 77.47 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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:17:25,591 INFO L168 Benchmark]: RCFGBuilder took 1015.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:17:25,591 INFO L168 Benchmark]: TraceAbstraction took 109620.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -105.1 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:17:25,593 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 713.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.47 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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1015.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109620.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -105.1 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...