./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcat-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_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 c15bd857267d499e7ecc6e455c2b5fbe7515d7da ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no XNF --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 01:12:41,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:12:41,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:12:41,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:12:41,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:12:41,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:12:41,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:12:41,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:12:41,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:12:41,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:12:41,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:12:41,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:12:41,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:12:41,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:12:41,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:12:41,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:12:41,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:12:41,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:12:41,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:12:41,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:12:41,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:12:41,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:12:41,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:12:41,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:12:41,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:12:41,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:12:41,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:12:41,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:12:41,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:12:41,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:12:41,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:12:41,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:12:41,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:12:41,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:12:41,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:12:41,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:12:41,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:12:41,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:12:41,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:12:41,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:12:41,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:12:41,286 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 01:12:41,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:12:41,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:12:41,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:12:41,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:12:41,302 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:12:41,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:12:41,302 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:12:41,302 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 01:12:41,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:12:41,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:12:41,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:12:41,303 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 01:12:41,303 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 01:12:41,304 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 01:12:41,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:12:41,304 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:12:41,304 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:12:41,304 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:12:41,304 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:12:41,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:12:41,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:12:41,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:12:41,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:12:41,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:12:41,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:12:41,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:12:41,306 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:12:41,306 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:12:41,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:12:41,307 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_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 -> c15bd857267d499e7ecc6e455c2b5fbe7515d7da [2019-11-20 01:12:41,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:12:41,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:12:41,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:12:41,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:12:41,470 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:12:41,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2019-11-20 01:12:41,524 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/data/b1beb5677/edfde7d1e9ab4d919c2c4ea86e79b176/FLAG15c96849b [2019-11-20 01:12:42,013 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:12:42,013 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2019-11-20 01:12:42,028 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/data/b1beb5677/edfde7d1e9ab4d919c2c4ea86e79b176/FLAG15c96849b [2019-11-20 01:12:42,500 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/bin/uautomizer/data/b1beb5677/edfde7d1e9ab4d919c2c4ea86e79b176 [2019-11-20 01:12:42,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:12:42,504 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 01:12:42,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:12:42,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:12:42,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:12:42,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:12:42" (1/1) ... [2019-11-20 01:12:42,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be8a722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:42, skipping insertion in model container [2019-11-20 01:12:42,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:12:42" (1/1) ... [2019-11-20 01:12:42,520 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:12:42,581 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:12:42,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:12:42,921 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:12:42,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:12:43,007 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:12:43,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43 WrapperNode [2019-11-20 01:12:43,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:12:43,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:12:43,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:12:43,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:12:43,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43" (1/1) ... [2019-11-20 01:12:43,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43" (1/1) ... [2019-11-20 01:12:43,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43" (1/1) ... [2019-11-20 01:12:43,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43" (1/1) ... [2019-11-20 01:12:43,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43" (1/1) ... [2019-11-20 01:12:43,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43" (1/1) ... [2019-11-20 01:12:43,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43" (1/1) ... [2019-11-20 01:12:43,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:12:43,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:12:43,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:12:43,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:12:43,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 01:12:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:12:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 01:12:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 01:12:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 01:12:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 01:12:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 01:12:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcat [2019-11-20 01:12:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 01:12:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 01:12:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 01:12:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 01:12:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 01:12:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 01:12:43,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 01:12:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 01:12:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 01:12:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 01:12:43,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 01:12:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 01:12:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 01:12:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 01:12:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 01:12:43,143 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 01:12:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 01:12:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 01:12:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 01:12:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 01:12:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 01:12:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 01:12:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 01:12:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 01:12:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 01:12:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 01:12:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 01:12:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 01:12:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 01:12:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 01:12:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 01:12:43,146 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 01:12:43,147 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 01:12:43,147 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 01:12:43,147 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 01:12:43,147 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 01:12:43,147 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 01:12:43,147 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 01:12:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 01:12:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 01:12:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 01:12:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 01:12:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 01:12:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 01:12:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 01:12:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 01:12:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 01:12:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 01:12:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 01:12:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 01:12:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 01:12:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 01:12:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 01:12:43,151 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 01:12:43,151 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 01:12:43,151 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 01:12:43,151 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 01:12:43,151 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 01:12:43,151 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 01:12:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 01:12:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 01:12:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 01:12:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 01:12:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 01:12:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 01:12:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 01:12:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 01:12:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 01:12:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 01:12:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 01:12:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 01:12:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 01:12:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 01:12:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 01:12:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 01:12:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 01:12:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 01:12:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 01:12:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 01:12:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 01:12:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 01:12:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 01:12:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 01:12:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 01:12:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 01:12:43,157 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 01:12:43,157 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 01:12:43,157 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 01:12:43,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 01:12:43,157 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 01:12:43,157 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 01:12:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 01:12:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 01:12:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 01:12:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 01:12:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 01:12:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 01:12:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 01:12:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 01:12:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 01:12:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 01:12:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 01:12:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 01:12:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 01:12:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 01:12:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 01:12:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 01:12:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 01:12:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 01:12:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-20 01:12:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcat [2019-11-20 01:12:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 01:12:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-20 01:12:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 01:12:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:12:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:12:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 01:12:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:12:43,971 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:12:43,972 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 01:12:43,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:12:43 BoogieIcfgContainer [2019-11-20 01:12:43,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:12:43,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:12:43,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:12:43,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:12:43,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:12:42" (1/3) ... [2019-11-20 01:12:43,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e786974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:12:43, skipping insertion in model container [2019-11-20 01:12:43,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:12:43" (2/3) ... [2019-11-20 01:12:43,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e786974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:12:43, skipping insertion in model container [2019-11-20 01:12:43,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:12:43" (3/3) ... [2019-11-20 01:12:43,979 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca-2.i [2019-11-20 01:12:43,988 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:12:43,994 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-11-20 01:12:44,002 INFO L249 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-11-20 01:12:44,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:12:44,022 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 01:12:44,022 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:12:44,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:12:44,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:12:44,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:12:44,022 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:12:44,022 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:12:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-20 01:12:44,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 01:12:44,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:44,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:44,050 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:44,056 INFO L82 PathProgramCache]: Analyzing trace with hash 697927889, now seen corresponding path program 1 times [2019-11-20 01:12:44,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:44,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2006226660] [2019-11-20 01:12:44,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:44,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:12:44,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:44,322 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 01:12:44,322 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:44,335 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 01:12:44,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2006226660] [2019-11-20 01:12:44,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:44,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:12:44,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701817224] [2019-11-20 01:12:44,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:12:44,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:44,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:12:44,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:12:44,357 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2019-11-20 01:12:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:44,501 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-11-20 01:12:44,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:12:44,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 01:12:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:44,512 INFO L225 Difference]: With dead ends: 53 [2019-11-20 01:12:44,512 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 01:12:44,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:12:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 01:12:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-20 01:12:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 01:12:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-20 01:12:44,548 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 11 [2019-11-20 01:12:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:44,548 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-20 01:12:44,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:12:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-20 01:12:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 01:12:44,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:44,550 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:44,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:44,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:44,757 INFO L82 PathProgramCache]: Analyzing trace with hash 160927933, now seen corresponding path program 1 times [2019-11-20 01:12:44,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:44,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [744134254] [2019-11-20 01:12:44,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:44,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:12:44,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:44,999 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 01:12:45,000 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:45,040 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 01:12:45,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [744134254] [2019-11-20 01:12:45,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:45,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 01:12:45,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241502708] [2019-11-20 01:12:45,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:12:45,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:45,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:12:45,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:12:45,043 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 6 states. [2019-11-20 01:12:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:45,212 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-20 01:12:45,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:12:45,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-20 01:12:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:45,216 INFO L225 Difference]: With dead ends: 70 [2019-11-20 01:12:45,216 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 01:12:45,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:12:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 01:12:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2019-11-20 01:12:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 01:12:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-11-20 01:12:45,242 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2019-11-20 01:12:45,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:45,243 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-11-20 01:12:45,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:12:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-11-20 01:12:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 01:12:45,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:45,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:45,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:45,447 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:45,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash 218186235, now seen corresponding path program 1 times [2019-11-20 01:12:45,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:45,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1777972719] [2019-11-20 01:12:45,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:45,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:12:45,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:45,721 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 01:12:45,725 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:45,916 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 01:12:45,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1777972719] [2019-11-20 01:12:45,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:45,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 01:12:45,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300632249] [2019-11-20 01:12:45,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:12:45,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:45,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:12:45,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:12:45,918 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 10 states. [2019-11-20 01:12:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:46,605 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2019-11-20 01:12:46,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:12:46,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-20 01:12:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:46,608 INFO L225 Difference]: With dead ends: 114 [2019-11-20 01:12:46,608 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 01:12:46,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:12:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 01:12:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 53. [2019-11-20 01:12:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 01:12:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-11-20 01:12:46,618 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2019-11-20 01:12:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:46,618 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-11-20 01:12:46,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:12:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-11-20 01:12:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 01:12:46,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:46,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:46,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:46,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash 220033277, now seen corresponding path program 1 times [2019-11-20 01:12:46,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:46,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1758872289] [2019-11-20 01:12:46,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:47,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:12:47,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:47,085 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:12:47,085 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 01:12:47,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:47,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:47,093 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 01:12:47,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 01:12:47,121 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 01:12:47,121 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:47,134 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 01:12:47,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1758872289] [2019-11-20 01:12:47,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:47,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:12:47,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046918875] [2019-11-20 01:12:47,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:12:47,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:12:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:12:47,136 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 3 states. [2019-11-20 01:12:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:47,225 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-11-20 01:12:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:12:47,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-20 01:12:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:47,227 INFO L225 Difference]: With dead ends: 51 [2019-11-20 01:12:47,227 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 01:12:47,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:12:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 01:12:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-20 01:12:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-20 01:12:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-11-20 01:12:47,236 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 12 [2019-11-20 01:12:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:47,237 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-20 01:12:47,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:12:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-11-20 01:12:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 01:12:47,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:47,238 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:47,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:47,441 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:47,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash 220033278, now seen corresponding path program 1 times [2019-11-20 01:12:47,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:47,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [701135975] [2019-11-20 01:12:47,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:47,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:12:47,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:47,647 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_45|]} [2019-11-20 01:12:47,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:12:47,658 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 01:12:47,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:47,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:47,695 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 01:12:47,695 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:47,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:47,721 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 01:12:47,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-11-20 01:12:47,741 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 01:12:47,742 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:47,862 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 01:12:47,880 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 01:12:47,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:47,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:47,902 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:12:47,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:47,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:47,912 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 01:12:47,912 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-11-20 01:12:47,921 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 01:12:47,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [701135975] [2019-11-20 01:12:47,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:47,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:12:47,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233568587] [2019-11-20 01:12:47,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:12:47,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:47,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:12:47,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:12:47,924 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 5 states. [2019-11-20 01:12:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:48,369 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2019-11-20 01:12:48,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:12:48,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-20 01:12:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:48,371 INFO L225 Difference]: With dead ends: 71 [2019-11-20 01:12:48,371 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 01:12:48,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:12:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 01:12:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-11-20 01:12:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 01:12:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-11-20 01:12:48,377 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 12 [2019-11-20 01:12:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:48,377 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-11-20 01:12:48,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:12:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-11-20 01:12:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 01:12:48,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:48,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:48,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:48,579 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:48,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash 32870805, now seen corresponding path program 1 times [2019-11-20 01:12:48,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:48,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2048536064] [2019-11-20 01:12:48,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:48,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:12:48,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:48,770 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 01:12:48,771 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:48,803 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 01:12:48,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2048536064] [2019-11-20 01:12:48,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:48,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 01:12:48,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250993689] [2019-11-20 01:12:48,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:12:48,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:12:48,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:12:48,805 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 6 states. [2019-11-20 01:12:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:49,006 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2019-11-20 01:12:49,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:12:49,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 01:12:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:49,008 INFO L225 Difference]: With dead ends: 79 [2019-11-20 01:12:49,008 INFO L226 Difference]: Without dead ends: 79 [2019-11-20 01:12:49,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:12:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-20 01:12:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2019-11-20 01:12:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-20 01:12:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-20 01:12:49,014 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 14 [2019-11-20 01:12:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:49,014 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-20 01:12:49,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:12:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-20 01:12:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 01:12:49,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:49,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:49,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:49,219 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:49,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:49,219 INFO L82 PathProgramCache]: Analyzing trace with hash 32870857, now seen corresponding path program 1 times [2019-11-20 01:12:49,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:49,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [541114123] [2019-11-20 01:12:49,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:49,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:12:49,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:49,413 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:12:49,414 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 01:12:49,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:49,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:49,426 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 01:12:49,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 01:12:49,439 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 01:12:49,440 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:49,454 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 01:12:49,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [541114123] [2019-11-20 01:12:49,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:49,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:12:49,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880076620] [2019-11-20 01:12:49,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:12:49,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:49,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:12:49,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:12:49,456 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2019-11-20 01:12:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:49,516 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-11-20 01:12:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:12:49,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-20 01:12:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:49,517 INFO L225 Difference]: With dead ends: 52 [2019-11-20 01:12:49,517 INFO L226 Difference]: Without dead ends: 52 [2019-11-20 01:12:49,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:12:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-20 01:12:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-20 01:12:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 01:12:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-11-20 01:12:49,522 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 14 [2019-11-20 01:12:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:49,522 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-11-20 01:12:49,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:12:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-11-20 01:12:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 01:12:49,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:49,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:49,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:49,727 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash 32870858, now seen corresponding path program 1 times [2019-11-20 01:12:49,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:49,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1463574664] [2019-11-20 01:12:49,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:49,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:12:49,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:49,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:49,903 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 01:12:49,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:49,925 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 01:12:49,926 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 01:12:49,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-20 01:12:49,946 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 01:12:49,946 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:50,075 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 01:12:50,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1463574664] [2019-11-20 01:12:50,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:50,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 01:12:50,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503600974] [2019-11-20 01:12:50,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:12:50,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:50,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:12:50,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:12:50,076 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 8 states. [2019-11-20 01:12:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:50,705 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2019-11-20 01:12:50,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:12:50,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-20 01:12:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:50,707 INFO L225 Difference]: With dead ends: 70 [2019-11-20 01:12:50,708 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 01:12:50,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:12:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 01:12:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2019-11-20 01:12:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-20 01:12:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-11-20 01:12:50,715 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 14 [2019-11-20 01:12:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:50,716 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-11-20 01:12:50,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:12:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2019-11-20 01:12:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 01:12:50,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:50,717 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:50,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:50,924 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1859671169, now seen corresponding path program 1 times [2019-11-20 01:12:50,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:50,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [626494635] [2019-11-20 01:12:50,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:51,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 01:12:51,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:51,090 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 1=[|v_#valid_63|]} [2019-11-20 01:12:51,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:12:51,100 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 01:12:51,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:51,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:51,123 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 01:12:51,124 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:51,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:51,140 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 01:12:51,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-11-20 01:12:51,237 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 01:12:51,238 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:51,694 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 01:12:51,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:12:51,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:51,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:51,699 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 01:12:51,699 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 01:12:51,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-11-20 01:12:51,703 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 01:12:51,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [626494635] [2019-11-20 01:12:51,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:12:51,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-20 01:12:51,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686839783] [2019-11-20 01:12:51,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:12:51,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:51,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:12:51,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:12:51,704 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 10 states. [2019-11-20 01:12:51,983 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-20 01:12:52,516 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-20 01:12:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:53,257 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2019-11-20 01:12:53,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 01:12:53,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-20 01:12:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:53,260 INFO L225 Difference]: With dead ends: 117 [2019-11-20 01:12:53,260 INFO L226 Difference]: Without dead ends: 117 [2019-11-20 01:12:53,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:12:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-20 01:12:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 78. [2019-11-20 01:12:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-20 01:12:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2019-11-20 01:12:53,276 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 16 [2019-11-20 01:12:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:53,276 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2019-11-20 01:12:53,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:12:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2019-11-20 01:12:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 01:12:53,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:53,277 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:53,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:53,481 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash 799869263, now seen corresponding path program 1 times [2019-11-20 01:12:53,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:53,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [789391793] [2019-11-20 01:12:53,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:53,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 01:12:53,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:53,650 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:53,650 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 01:12:53,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:53,680 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 01:12:53,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:12:53,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-11-20 01:12:53,738 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 01:12:53,738 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:54,192 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 01:12:54,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [789391793] [2019-11-20 01:12:54,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:12:54,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2019-11-20 01:12:54,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394591979] [2019-11-20 01:12:54,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 01:12:54,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:54,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 01:12:54,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:12:54,194 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand 11 states. [2019-11-20 01:12:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:54,685 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2019-11-20 01:12:54,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:12:54,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-20 01:12:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:54,686 INFO L225 Difference]: With dead ends: 106 [2019-11-20 01:12:54,686 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 01:12:54,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:12:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 01:12:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2019-11-20 01:12:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-20 01:12:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2019-11-20 01:12:54,692 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 18 [2019-11-20 01:12:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:54,692 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2019-11-20 01:12:54,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 01:12:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2019-11-20 01:12:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:12:54,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:54,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:54,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:54,897 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:54,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1232023695, now seen corresponding path program 1 times [2019-11-20 01:12:54,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:54,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [820354264] [2019-11-20 01:12:54,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:55,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 01:12:55,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:55,087 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:55,088 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 01:12:55,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:55,115 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-20 01:12:55,116 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 01:12:55,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-11-20 01:12:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:12:55,172 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:55,481 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 01:12:55,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [820354264] [2019-11-20 01:12:55,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:12:55,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-20 01:12:55,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061240737] [2019-11-20 01:12:55,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:12:55,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:55,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:12:55,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:12:55,483 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 6 states. [2019-11-20 01:12:55,818 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 01:12:56,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:56,347 INFO L93 Difference]: Finished difference Result 144 states and 171 transitions. [2019-11-20 01:12:56,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:12:56,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-20 01:12:56,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:56,350 INFO L225 Difference]: With dead ends: 144 [2019-11-20 01:12:56,350 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 01:12:56,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:12:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 01:12:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2019-11-20 01:12:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-20 01:12:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 166 transitions. [2019-11-20 01:12:56,356 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 166 transitions. Word has length 19 [2019-11-20 01:12:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:56,357 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 166 transitions. [2019-11-20 01:12:56,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:12:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 166 transitions. [2019-11-20 01:12:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:12:56,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:56,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:12:56,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:56,570 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:56,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:56,570 INFO L82 PathProgramCache]: Analyzing trace with hash -530959117, now seen corresponding path program 1 times [2019-11-20 01:12:56,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:56,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1996581041] [2019-11-20 01:12:56,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:56,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:12:56,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:56,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:56,759 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 01:12:56,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:56,794 INFO L567 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2019-11-20 01:12:56,794 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 01:12:56,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-11-20 01:12:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:12:56,845 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:57,285 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 01:12:57,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1996581041] [2019-11-20 01:12:57,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:12:57,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-20 01:12:57,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672952799] [2019-11-20 01:12:57,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:12:57,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:57,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:12:57,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:12:57,286 INFO L87 Difference]: Start difference. First operand 136 states and 166 transitions. Second operand 6 states. [2019-11-20 01:12:57,592 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 01:12:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:57,951 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2019-11-20 01:12:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:12:57,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-20 01:12:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:57,954 INFO L225 Difference]: With dead ends: 137 [2019-11-20 01:12:57,954 INFO L226 Difference]: Without dead ends: 137 [2019-11-20 01:12:57,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:12:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-20 01:12:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-11-20 01:12:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 01:12:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2019-11-20 01:12:57,959 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 19 [2019-11-20 01:12:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:57,960 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2019-11-20 01:12:57,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:12:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2019-11-20 01:12:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 01:12:57,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:57,961 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] [2019-11-20 01:12:58,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:58,164 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:58,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1572671214, now seen corresponding path program 1 times [2019-11-20 01:12:58,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:58,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1019712035] [2019-11-20 01:12:58,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:58,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:12:58,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:58,386 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:12:58,387 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 01:12:58,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:58,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:58,393 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 01:12:58,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 01:12:58,419 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 01:12:58,419 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:58,430 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 01:12:58,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1019712035] [2019-11-20 01:12:58,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:58,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 01:12:58,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904395451] [2019-11-20 01:12:58,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:12:58,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:58,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:12:58,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:12:58,432 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand 5 states. [2019-11-20 01:12:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:58,551 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2019-11-20 01:12:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:12:58,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-20 01:12:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:58,552 INFO L225 Difference]: With dead ends: 84 [2019-11-20 01:12:58,552 INFO L226 Difference]: Without dead ends: 84 [2019-11-20 01:12:58,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:12:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-20 01:12:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-11-20 01:12:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 01:12:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2019-11-20 01:12:58,555 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 22 [2019-11-20 01:12:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:58,556 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2019-11-20 01:12:58,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:12:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2019-11-20 01:12:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 01:12:58,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:58,557 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] [2019-11-20 01:12:58,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:12:58,757 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:12:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:12:58,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1572671215, now seen corresponding path program 1 times [2019-11-20 01:12:58,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:12:58,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1392907610] [2019-11-20 01:12:58,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:12:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:12:58,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:12:58,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:12:58,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:12:58,959 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 01:12:58,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:12:58,981 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 01:12:58,982 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 01:12:58,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-20 01:12:59,012 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 01:12:59,013 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:12:59,207 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 01:12:59,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1392907610] [2019-11-20 01:12:59,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:12:59,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 01:12:59,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797260748] [2019-11-20 01:12:59,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:12:59,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:12:59,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:12:59,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:12:59,208 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 10 states. [2019-11-20 01:12:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:12:59,842 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-11-20 01:12:59,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:12:59,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 01:12:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:12:59,846 INFO L225 Difference]: With dead ends: 122 [2019-11-20 01:12:59,846 INFO L226 Difference]: Without dead ends: 122 [2019-11-20 01:12:59,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:12:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-20 01:12:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2019-11-20 01:12:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 01:12:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2019-11-20 01:12:59,851 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 22 [2019-11-20 01:12:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:12:59,851 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2019-11-20 01:12:59,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:12:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2019-11-20 01:12:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 01:12:59,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:12:59,852 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:13:00,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:13:00,056 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:13:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:13:00,056 INFO L82 PathProgramCache]: Analyzing trace with hash 341430482, now seen corresponding path program 2 times [2019-11-20 01:13:00,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:13:00,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1131333728] [2019-11-20 01:13:00,056 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:13:00,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:13:00,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:13:00,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:13:00,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:13:00,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:13:00,323 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 01:13:00,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:13:00,378 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 01:13:00,378 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 01:13:00,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 01:13:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:13:00,629 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:13:01,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:13:05,486 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-11-20 01:13:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:13:19,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1131333728] [2019-11-20 01:13:19,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:13:19,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-20 01:13:19,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640501321] [2019-11-20 01:13:19,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:13:19,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:13:19,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:13:19,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2019-11-20 01:13:19,348 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand 12 states. [2019-11-20 01:13:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:13:21,311 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2019-11-20 01:13:21,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:13:21,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-20 01:13:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:13:21,314 INFO L225 Difference]: With dead ends: 115 [2019-11-20 01:13:21,315 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 01:13:21,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=76, Invalid=133, Unknown=1, NotChecked=0, Total=210 [2019-11-20 01:13:21,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 01:13:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2019-11-20 01:13:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-20 01:13:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2019-11-20 01:13:21,320 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 22 [2019-11-20 01:13:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:13:21,321 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2019-11-20 01:13:21,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:13:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2019-11-20 01:13:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 01:13:21,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:13:21,322 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] [2019-11-20 01:13:21,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:13:21,526 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:13:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:13:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash 631589147, now seen corresponding path program 1 times [2019-11-20 01:13:21,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:13:21,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2096581798] [2019-11-20 01:13:21,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:13:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:13:21,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 01:13:21,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:13:22,056 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 01:13:22,056 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:13:22,703 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 01:13:22,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2096581798] [2019-11-20 01:13:22,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:13:22,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-20 01:13:22,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057921513] [2019-11-20 01:13:22,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:13:22,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:13:22,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:13:22,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:13:22,705 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 18 states. [2019-11-20 01:13:25,097 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 01:13:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:13:27,102 INFO L93 Difference]: Finished difference Result 189 states and 222 transitions. [2019-11-20 01:13:27,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 01:13:27,105 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-11-20 01:13:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:13:27,106 INFO L225 Difference]: With dead ends: 189 [2019-11-20 01:13:27,106 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 01:13:27,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=449, Invalid=1273, Unknown=0, NotChecked=0, Total=1722 [2019-11-20 01:13:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 01:13:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 110. [2019-11-20 01:13:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-20 01:13:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2019-11-20 01:13:27,111 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 22 [2019-11-20 01:13:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:13:27,111 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2019-11-20 01:13:27,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:13:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2019-11-20 01:13:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 01:13:27,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:13:27,113 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] [2019-11-20 01:13:27,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:13:27,318 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:13:27,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:13:27,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2079797462, now seen corresponding path program 1 times [2019-11-20 01:13:27,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:13:27,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1710944924] [2019-11-20 01:13:27,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:13:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:13:27,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 01:13:27,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:13:27,544 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 01:13:27,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:13:27,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:13:27,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:13:27,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-20 01:13:27,592 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 01:13:27,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:13:27,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:13:27,594 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 01:13:27,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 01:13:27,604 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 01:13:27,604 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:13:27,659 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 01:13:27,663 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 01:13:27,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:13:27,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:13:27,666 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:13:27,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:13:27,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:13:27,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-20 01:13:27,672 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 01:13:27,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1710944924] [2019-11-20 01:13:27,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:13:27,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2019-11-20 01:13:27,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959266228] [2019-11-20 01:13:27,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 01:13:27,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:13:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 01:13:27,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:13:27,674 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand 11 states. [2019-11-20 01:13:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:13:27,890 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2019-11-20 01:13:27,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:13:27,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-20 01:13:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:13:27,892 INFO L225 Difference]: With dead ends: 164 [2019-11-20 01:13:27,892 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 01:13:27,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:13:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 01:13:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-11-20 01:13:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 01:13:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 182 transitions. [2019-11-20 01:13:27,899 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 182 transitions. Word has length 24 [2019-11-20 01:13:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:13:27,899 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 182 transitions. [2019-11-20 01:13:27,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 01:13:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 182 transitions. [2019-11-20 01:13:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 01:13:27,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:13:27,900 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] [2019-11-20 01:13:28,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:13:28,104 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:13:28,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:13:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1194101480, now seen corresponding path program 1 times [2019-11-20 01:13:28,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:13:28,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [129768853] [2019-11-20 01:13:28,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:13:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:13:28,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 01:13:28,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:13:28,325 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:13:28,326 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 01:13:28,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:13:28,368 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 01:13:28,369 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 01:13:28,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 01:13:28,636 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 01:13:28,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:13:29,776 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 01:13:29,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [129768853] [2019-11-20 01:13:29,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:13:29,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-20 01:13:29,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672173785] [2019-11-20 01:13:29,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:13:29,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:13:29,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:13:29,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:13:29,778 INFO L87 Difference]: Start difference. First operand 149 states and 182 transitions. Second operand 18 states. [2019-11-20 01:13:31,734 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-11-20 01:13:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:13:32,658 INFO L93 Difference]: Finished difference Result 288 states and 357 transitions. [2019-11-20 01:13:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:13:32,659 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-11-20 01:13:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:13:32,662 INFO L225 Difference]: With dead ends: 288 [2019-11-20 01:13:32,662 INFO L226 Difference]: Without dead ends: 288 [2019-11-20 01:13:32,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-20 01:13:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-20 01:13:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 112. [2019-11-20 01:13:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-20 01:13:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2019-11-20 01:13:32,672 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2019-11-20 01:13:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:13:32,673 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2019-11-20 01:13:32,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:13:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2019-11-20 01:13:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 01:13:32,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:13:32,674 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 01:13:32,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:13:32,878 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:13:32,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:13:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1944931375, now seen corresponding path program 1 times [2019-11-20 01:13:32,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:13:32,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [553884543] [2019-11-20 01:13:32,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:13:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:13:33,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:13:33,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:13:33,227 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 01:13:33,228 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:13:33,242 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 01:13:33,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [553884543] [2019-11-20 01:13:33,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:13:33,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2019-11-20 01:13:33,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051186702] [2019-11-20 01:13:33,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:13:33,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:13:33,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:13:33,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:13:33,244 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 7 states. [2019-11-20 01:13:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:13:33,444 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2019-11-20 01:13:33,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:13:33,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-20 01:13:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:13:33,446 INFO L225 Difference]: With dead ends: 111 [2019-11-20 01:13:33,446 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 01:13:33,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:13:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 01:13:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 01:13:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 01:13:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2019-11-20 01:13:33,451 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 25 [2019-11-20 01:13:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:13:33,451 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2019-11-20 01:13:33,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:13:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2019-11-20 01:13:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 01:13:33,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:13:33,452 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 01:13:33,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:13:33,657 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:13:33,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:13:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1944931376, now seen corresponding path program 1 times [2019-11-20 01:13:33,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:13:33,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1105254993] [2019-11-20 01:13:33,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:13:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:13:33,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:13:33,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:13:34,021 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 01:13:34,021 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:13:34,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:13:34,361 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 12 treesize of output 10 [2019-11-20 01:13:34,362 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 01:13:34,386 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 16 treesize of output 12 [2019-11-20 01:13:34,387 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 01:13:34,404 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 12 [2019-11-20 01:13:34,405 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 01:13:34,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:13:34,466 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 01:13:34,467 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:35 [2019-11-20 01:13:34,799 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 01:13:34,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1105254993] [2019-11-20 01:13:34,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:13:34,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-20 01:13:34,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357483922] [2019-11-20 01:13:34,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 01:13:34,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:13:34,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 01:13:34,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:13:34,801 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand 14 states. [2019-11-20 01:13:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:13:36,065 INFO L93 Difference]: Finished difference Result 143 states and 170 transitions. [2019-11-20 01:13:36,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 01:13:36,081 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-20 01:13:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:13:36,082 INFO L225 Difference]: With dead ends: 143 [2019-11-20 01:13:36,083 INFO L226 Difference]: Without dead ends: 143 [2019-11-20 01:13:36,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:13:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-20 01:13:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 113. [2019-11-20 01:13:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-20 01:13:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2019-11-20 01:13:36,088 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 25 [2019-11-20 01:13:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:13:36,089 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2019-11-20 01:13:36,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 01:13:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2019-11-20 01:13:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 01:13:36,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:13:36,090 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:13:36,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:13:36,291 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:13:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:13:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2127326983, now seen corresponding path program 2 times [2019-11-20 01:13:36,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:13:36,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [710966388] [2019-11-20 01:13:36,292 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:13:36,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:13:36,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:13:36,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 01:13:36,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:13:36,580 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_46|], 1=[|v_#valid_111|]} [2019-11-20 01:13:36,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:13:36,589 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 01:13:36,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:13:36,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:13:36,639 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 01:13:36,640 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:13:36,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:13:36,659 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 01:13:36,659 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:13 [2019-11-20 01:13:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:13:36,895 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:13:37,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:13:42,144 WARN L191 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-11-20 01:14:03,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:03,768 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-20 01:14:03,795 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 41 treesize of output 39 [2019-11-20 01:14:03,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:03,903 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2019-11-20 01:14:03,903 INFO L567 ElimStorePlain]: treesize reduction 27, result has 56.5 percent of original size [2019-11-20 01:14:03,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:14:03,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:03,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:03,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:14:03,956 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:24 [2019-11-20 01:14:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:14:06,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [710966388] [2019-11-20 01:14:06,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:14:06,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-20 01:14:06,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855426220] [2019-11-20 01:14:06,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:14:06,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:14:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:14:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2019-11-20 01:14:06,345 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 12 states. [2019-11-20 01:14:07,012 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-11-20 01:14:07,492 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-11-20 01:14:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:09,098 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2019-11-20 01:14:09,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:14:09,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-20 01:14:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:09,103 INFO L225 Difference]: With dead ends: 142 [2019-11-20 01:14:09,103 INFO L226 Difference]: Without dead ends: 142 [2019-11-20 01:14:09,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=76, Invalid=133, Unknown=1, NotChecked=0, Total=210 [2019-11-20 01:14:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-20 01:14:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2019-11-20 01:14:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 01:14:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2019-11-20 01:14:09,108 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 24 [2019-11-20 01:14:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:09,109 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2019-11-20 01:14:09,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:14:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2019-11-20 01:14:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 01:14:09,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:09,110 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] [2019-11-20 01:14:09,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:14:09,310 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:14:09,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash 163330554, now seen corresponding path program 1 times [2019-11-20 01:14:09,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:14:09,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [470596432] [2019-11-20 01:14:09,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:14:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:09,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:14:09,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:14:09,551 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:14:09,551 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 01:14:09,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:09,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:09,557 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 01:14:09,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 01:14:09,593 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 01:14:09,593 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:14:09,608 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 01:14:09,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [470596432] [2019-11-20 01:14:09,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:09,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 01:14:09,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771744540] [2019-11-20 01:14:09,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:14:09,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:14:09,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:14:09,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:14:09,609 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand 6 states. [2019-11-20 01:14:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:09,784 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2019-11-20 01:14:09,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:14:09,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-20 01:14:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:09,787 INFO L225 Difference]: With dead ends: 83 [2019-11-20 01:14:09,787 INFO L226 Difference]: Without dead ends: 83 [2019-11-20 01:14:09,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:14:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-20 01:14:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-20 01:14:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-20 01:14:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2019-11-20 01:14:09,791 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 26 [2019-11-20 01:14:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:09,791 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2019-11-20 01:14:09,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:14:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2019-11-20 01:14:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 01:14:09,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:09,792 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] [2019-11-20 01:14:09,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:14:09,997 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:14:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:09,997 INFO L82 PathProgramCache]: Analyzing trace with hash 163330555, now seen corresponding path program 1 times [2019-11-20 01:14:09,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:14:09,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [368441230] [2019-11-20 01:14:09,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:14:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:10,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:14:10,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:14:10,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:10,263 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 01:14:10,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:10,287 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 01:14:10,288 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 01:14:10,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-20 01:14:10,338 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 01:14:10,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:14:10,647 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 01:14:10,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [368441230] [2019-11-20 01:14:10,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:10,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-20 01:14:10,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711327845] [2019-11-20 01:14:10,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:14:10,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:14:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:14:10,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:14:10,648 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand 12 states. [2019-11-20 01:14:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:11,866 INFO L93 Difference]: Finished difference Result 142 states and 165 transitions. [2019-11-20 01:14:11,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:14:11,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-20 01:14:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:11,868 INFO L225 Difference]: With dead ends: 142 [2019-11-20 01:14:11,868 INFO L226 Difference]: Without dead ends: 142 [2019-11-20 01:14:11,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-11-20 01:14:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-20 01:14:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2019-11-20 01:14:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-20 01:14:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 159 transitions. [2019-11-20 01:14:11,874 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 159 transitions. Word has length 26 [2019-11-20 01:14:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:11,874 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 159 transitions. [2019-11-20 01:14:11,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:14:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 159 transitions. [2019-11-20 01:14:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 01:14:11,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:11,876 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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 01:14:12,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:14:12,080 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:14:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1830768289, now seen corresponding path program 1 times [2019-11-20 01:14:12,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:14:12,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [30309257] [2019-11-20 01:14:12,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:14:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:12,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 01:14:12,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:14:12,503 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 01:14:12,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:12,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:12,548 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 01:14:12,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-11-20 01:14:12,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:14:12,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:12,749 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 01:14:12,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:12,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:12,770 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 01:14:12,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:5 [2019-11-20 01:14:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:14:12,799 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:14:12,944 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 01:14:12,947 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 01:14:12,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:12,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:12,950 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:14:12,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:12,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:14:12,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-11-20 01:14:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:14:13,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [30309257] [2019-11-20 01:14:13,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:13,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 17 [2019-11-20 01:14:13,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578831626] [2019-11-20 01:14:13,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 01:14:13,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:14:13,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 01:14:13,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:14:13,270 INFO L87 Difference]: Start difference. First operand 132 states and 159 transitions. Second operand 17 states. [2019-11-20 01:14:13,838 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-11-20 01:14:15,360 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 01:14:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:16,317 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2019-11-20 01:14:16,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 01:14:16,319 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-11-20 01:14:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:16,320 INFO L225 Difference]: With dead ends: 186 [2019-11-20 01:14:16,321 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 01:14:16,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 01:14:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 01:14:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 113. [2019-11-20 01:14:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-20 01:14:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2019-11-20 01:14:16,332 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 26 [2019-11-20 01:14:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:16,332 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2019-11-20 01:14:16,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 01:14:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2019-11-20 01:14:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 01:14:16,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:16,334 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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 01:14:16,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:14:16,538 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:14:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 775255265, now seen corresponding path program 2 times [2019-11-20 01:14:16,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:14:16,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [453466651] [2019-11-20 01:14:16,539 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:14:16,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:14:16,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:14:16,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 01:14:16,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:14:16,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:14:16,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:16,856 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 01:14:16,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:16,945 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-20 01:14:16,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:14:16,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-11-20 01:14:17,374 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 31 treesize of output 23 [2019-11-20 01:14:17,374 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 01:14:17,529 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-11-20 01:14:17,529 INFO L567 ElimStorePlain]: treesize reduction 8, result has 86.4 percent of original size [2019-11-20 01:14:17,546 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 01:14:17,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:17,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:17,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:14:17,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:47 [2019-11-20 01:14:18,002 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:14:18,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:18,006 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 01:14:18,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:18,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:18,063 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 01:14:18,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-11-20 01:14:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:14:18,153 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:14:18,451 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 01:14:18,477 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 01:14:18,478 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:18,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:18,480 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:14:18,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:18,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:14:18,526 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:31 [2019-11-20 01:14:20,511 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-11-20 01:14:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:14:21,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [453466651] [2019-11-20 01:14:21,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:14:21,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-20 01:14:21,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796542012] [2019-11-20 01:14:21,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 01:14:21,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:14:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 01:14:21,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-11-20 01:14:21,014 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 24 states. [2019-11-20 01:14:21,627 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 01:14:22,311 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 01:14:23,177 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 01:14:24,051 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 01:14:24,913 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 01:14:25,576 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-20 01:14:25,938 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 01:14:26,635 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-11-20 01:14:26,890 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2019-11-20 01:14:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:28,011 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2019-11-20 01:14:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-20 01:14:28,013 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-11-20 01:14:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:28,015 INFO L225 Difference]: With dead ends: 237 [2019-11-20 01:14:28,015 INFO L226 Difference]: Without dead ends: 237 [2019-11-20 01:14:28,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=327, Invalid=1395, Unknown=0, NotChecked=0, Total=1722 [2019-11-20 01:14:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-20 01:14:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 118. [2019-11-20 01:14:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-20 01:14:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-11-20 01:14:28,021 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 26 [2019-11-20 01:14:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:28,021 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-20 01:14:28,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 01:14:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2019-11-20 01:14:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:14:28,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:28,022 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:14:28,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:14:28,226 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr3REQUIRES_VIOLATION, cstrcatErr2REQUIRES_VIOLATION, cstrcatErr4REQUIRES_VIOLATION, cstrcatErr0REQUIRES_VIOLATION, cstrcatErr5REQUIRES_VIOLATION, cstrcatErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-20 01:14:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:28,226 INFO L82 PathProgramCache]: Analyzing trace with hash -417333064, now seen corresponding path program 1 times [2019-11-20 01:14:28,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:14:28,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1134066840] [2019-11-20 01:14:28,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2614c4-42ce-48bc-bdb7-5c0562cb1036/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 01:14:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:28,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 01:14:28,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:14:28,513 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 01:14:28,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:28,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:28,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:14:28,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-20 01:14:28,568 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 01:14:28,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:28,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:28,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:14:28,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-20 01:14:28,629 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 21 treesize of output 20 [2019-11-20 01:14:28,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:28,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:28,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:14:28,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-20 01:14:28,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-11-20 01:14:28,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:14:28,991 INFO L567 ElimStorePlain]: treesize reduction 6, result has 62.5 percent of original size [2019-11-20 01:14:28,992 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 01:14:28,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-11-20 01:14:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:14:29,023 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:14:35,477 WARN L191 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-20 01:14:35,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:14:35,478 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 78 treesize of output 106 [2019-11-20 01:14:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:14:35,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:14:35,718 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) 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 01:14:35,722 INFO L168 Benchmark]: Toolchain (without parser) took 113218.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -222.2 MB). Peak memory consumption was 275.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:14:35,722 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:14:35,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:14:35,723 INFO L168 Benchmark]: Boogie Preprocessor took 61.87 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:14:35,724 INFO L168 Benchmark]: RCFGBuilder took 902.33 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:14:35,725 INFO L168 Benchmark]: TraceAbstraction took 111747.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.6 MB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:14:35,728 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.85 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 502.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.87 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 902.33 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111747.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.6 MB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...