./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.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_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 61cac7be0490384ca2e2fa5b07a6c43e88983407 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 11:31:32,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:31:32,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:31:32,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:31:32,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:31:32,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:31:32,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:31:32,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:31:32,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:31:32,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:31:32,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:31:32,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:31:32,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:31:32,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:31:32,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:31:32,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:31:32,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:31:32,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:31:32,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:31:32,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:31:32,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:31:32,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:31:32,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:31:32,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:31:32,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:31:32,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:31:32,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:31:32,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:31:32,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:31:32,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:31:32,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:31:32,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:31:32,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:31:32,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:31:32,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:31:32,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:31:32,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:31:32,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:31:32,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:31:32,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:31:32,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:31:32,887 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 11:31:32,902 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:31:32,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:31:32,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:31:32,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:31:32,903 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:31:32,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:31:32,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:31:32,904 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:31:32,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:31:32,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:31:32,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:31:32,905 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 11:31:32,905 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 11:31:32,905 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 11:31:32,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:31:32,905 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:31:32,905 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:31:32,906 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:31:32,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:31:32,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:31:32,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:31:32,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:31:32,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:31:32,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:31:32,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:31:32,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:31:32,907 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:31:32,907 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:31:32,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:31:32,908 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_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 -> 61cac7be0490384ca2e2fa5b07a6c43e88983407 [2019-11-20 11:31:33,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:31:33,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:31:33,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:31:33,074 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:31:33,075 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:31:33,075 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2019-11-20 11:31:33,130 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/data/3c928b39c/79366641f4b0445fb7c7a3530ec679f3/FLAG8397f4bc2 [2019-11-20 11:31:33,610 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:31:33,611 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2019-11-20 11:31:33,621 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/data/3c928b39c/79366641f4b0445fb7c7a3530ec679f3/FLAG8397f4bc2 [2019-11-20 11:31:33,634 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/bin/uautomizer/data/3c928b39c/79366641f4b0445fb7c7a3530ec679f3 [2019-11-20 11:31:33,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:31:33,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 11:31:33,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:31:33,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:31:33,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:31:33,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:31:33" (1/1) ... [2019-11-20 11:31:33,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211af8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:33, skipping insertion in model container [2019-11-20 11:31:33,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:31:33" (1/1) ... [2019-11-20 11:31:33,658 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:31:33,715 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:31:34,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:31:34,180 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:31:34,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:31:34,276 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:31:34,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34 WrapperNode [2019-11-20 11:31:34,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:31:34,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:31:34,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:31:34,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:31:34,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34" (1/1) ... [2019-11-20 11:31:34,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34" (1/1) ... [2019-11-20 11:31:34,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34" (1/1) ... [2019-11-20 11:31:34,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34" (1/1) ... [2019-11-20 11:31:34,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34" (1/1) ... [2019-11-20 11:31:34,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34" (1/1) ... [2019-11-20 11:31:34,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34" (1/1) ... [2019-11-20 11:31:34,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:31:34,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:31:34,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:31:34,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:31:34,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:34,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 11:31:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:31:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 11:31:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 11:31:34,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 11:31:34,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 11:31:34,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 11:31:34,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 11:31:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 11:31:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 11:31:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 11:31:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 11:31:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 11:31:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 11:31:34,391 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 11:31:34,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 11:31:34,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 11:31:34,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 11:31:34,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 11:31:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 11:31:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 11:31:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 11:31:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 11:31:34,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 11:31:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 11:31:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 11:31:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 11:31:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 11:31:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 11:31:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 11:31:34,395 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 11:31:34,395 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 11:31:34,395 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 11:31:34,395 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 11:31:34,395 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 11:31:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 11:31:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 11:31:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 11:31:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 11:31:34,396 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 11:31:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 11:31:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 11:31:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 11:31:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 11:31:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 11:31:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 11:31:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 11:31:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 11:31:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 11:31:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 11:31:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 11:31:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 11:31:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 11:31:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 11:31:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 11:31:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 11:31:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 11:31:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 11:31:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 11:31:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 11:31:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 11:31:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 11:31:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 11:31:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 11:31:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 11:31:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 11:31:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 11:31:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 11:31:34,401 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 11:31:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 11:31:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 11:31:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 11:31:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 11:31:34,402 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 11:31:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 11:31:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 11:31:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 11:31:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 11:31:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 11:31:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 11:31:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 11:31:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 11:31:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 11:31:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 11:31:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 11:31:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 11:31:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 11:31:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 11:31:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 11:31:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 11:31:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 11:31:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 11:31:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 11:31:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 11:31:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 11:31:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 11:31:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 11:31:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 11:31:34,407 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 11:31:34,407 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 11:31:34,407 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 11:31:34,407 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 11:31:34,407 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 11:31:34,407 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 11:31:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 11:31:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 11:31:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 11:31:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 11:31:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 11:31:34,408 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 11:31:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 11:31:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 11:31:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 11:31:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 11:31:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 11:31:34,409 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 11:31:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 11:31:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 11:31:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:31:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:31:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:31:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:31:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 11:31:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:31:35,062 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:31:35,062 INFO L285 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-20 11:31:35,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:35 BoogieIcfgContainer [2019-11-20 11:31:35,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:31:35,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:31:35,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:31:35,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:31:35,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:31:33" (1/3) ... [2019-11-20 11:31:35,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc3ea41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:31:35, skipping insertion in model container [2019-11-20 11:31:35,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:31:34" (2/3) ... [2019-11-20 11:31:35,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc3ea41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:31:35, skipping insertion in model container [2019-11-20 11:31:35,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:31:35" (3/3) ... [2019-11-20 11:31:35,071 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2019-11-20 11:31:35,079 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:31:35,086 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2019-11-20 11:31:35,096 INFO L249 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2019-11-20 11:31:35,113 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:31:35,113 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 11:31:35,114 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:31:35,122 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:31:35,122 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:31:35,123 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:31:35,124 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:31:35,124 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:31:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-11-20 11:31:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 11:31:35,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:35,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:35,163 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash -407322490, now seen corresponding path program 1 times [2019-11-20 11:31:35,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:35,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2044837986] [2019-11-20 11:31:35,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:35,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:31:35,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:35,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:31:35,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:35,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:35,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:35,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:31:35,515 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 11:31:35,515 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:35,525 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 11:31:35,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2044837986] [2019-11-20 11:31:35,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:35,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 11:31:35,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884602906] [2019-11-20 11:31:35,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:31:35,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:31:35,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:31:35,549 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2019-11-20 11:31:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:35,745 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-20 11:31:35,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:35,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-20 11:31:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:35,760 INFO L225 Difference]: With dead ends: 64 [2019-11-20 11:31:35,761 INFO L226 Difference]: Without dead ends: 60 [2019-11-20 11:31:35,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 11:31:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-20 11:31:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-11-20 11:31:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-20 11:31:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-11-20 11:31:35,811 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 7 [2019-11-20 11:31:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:35,811 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-11-20 11:31:35,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:31:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-11-20 11:31:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 11:31:35,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:35,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:36,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:36,014 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash -407322489, now seen corresponding path program 1 times [2019-11-20 11:31:36,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:36,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [29949984] [2019-11-20 11:31:36,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:36,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:31:36,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:36,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:31:36,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:36,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:36,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:36,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:31:36,207 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 11:31:36,207 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:36,245 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 11:31:36,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [29949984] [2019-11-20 11:31:36,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:36,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 11:31:36,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178356912] [2019-11-20 11:31:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:31:36,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:31:36,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:36,250 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 4 states. [2019-11-20 11:31:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:36,522 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-20 11:31:36,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:31:36,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-20 11:31:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:36,525 INFO L225 Difference]: With dead ends: 55 [2019-11-20 11:31:36,525 INFO L226 Difference]: Without dead ends: 55 [2019-11-20 11:31:36,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-20 11:31:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-20 11:31:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 11:31:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-11-20 11:31:36,539 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 7 [2019-11-20 11:31:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:36,539 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-11-20 11:31:36,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:31:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-11-20 11:31:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 11:31:36,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:36,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:36,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:36,746 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:36,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2065409137, now seen corresponding path program 1 times [2019-11-20 11:31:36,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:36,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [779520161] [2019-11-20 11:31:36,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:36,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:31:36,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:36,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:31:36,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:36,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:36,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:36,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:31:36,974 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 11:31:36,974 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:36,987 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 11:31:36,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [779520161] [2019-11-20 11:31:36,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:36,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 11:31:36,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266579519] [2019-11-20 11:31:36,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:31:36,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:31:36,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:36,989 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2019-11-20 11:31:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:37,224 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-11-20 11:31:37,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:31:37,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-20 11:31:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:37,226 INFO L225 Difference]: With dead ends: 59 [2019-11-20 11:31:37,226 INFO L226 Difference]: Without dead ends: 59 [2019-11-20 11:31:37,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:31:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-20 11:31:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-11-20 11:31:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 11:31:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-11-20 11:31:37,233 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 13 [2019-11-20 11:31:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:37,237 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-20 11:31:37,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:31:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-11-20 11:31:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 11:31:37,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:37,238 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:37,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:37,442 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2065409138, now seen corresponding path program 1 times [2019-11-20 11:31:37,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:37,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1579440416] [2019-11-20 11:31:37,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:37,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:31:37,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:37,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:31:37,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:37,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:37,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:37,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:31:37,661 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 11:31:37,661 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:37,738 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 11:31:37,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1579440416] [2019-11-20 11:31:37,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:37,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 11:31:37,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067206979] [2019-11-20 11:31:37,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:31:37,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:37,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:31:37,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:31:37,740 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 6 states. [2019-11-20 11:31:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:38,094 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-20 11:31:38,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:31:38,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-20 11:31:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:38,096 INFO L225 Difference]: With dead ends: 86 [2019-11-20 11:31:38,096 INFO L226 Difference]: Without dead ends: 86 [2019-11-20 11:31:38,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:31:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-20 11:31:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-11-20 11:31:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-20 11:31:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2019-11-20 11:31:38,104 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 13 [2019-11-20 11:31:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:38,104 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2019-11-20 11:31:38,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:31:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2019-11-20 11:31:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 11:31:38,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:38,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:38,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:38,306 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -396827094, now seen corresponding path program 1 times [2019-11-20 11:31:38,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:38,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [434990838] [2019-11-20 11:31:38,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:38,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:31:38,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:38,471 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 11:31:38,471 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:38,477 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 11:31:38,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [434990838] [2019-11-20 11:31:38,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:38,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 11:31:38,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766248912] [2019-11-20 11:31:38,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:31:38,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:38,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:31:38,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:31:38,479 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand 4 states. [2019-11-20 11:31:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:38,667 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2019-11-20 11:31:38,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:31:38,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 11:31:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:38,668 INFO L225 Difference]: With dead ends: 90 [2019-11-20 11:31:38,668 INFO L226 Difference]: Without dead ends: 90 [2019-11-20 11:31:38,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:31:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-20 11:31:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2019-11-20 11:31:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-20 11:31:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2019-11-20 11:31:38,677 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 14 [2019-11-20 11:31:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:38,678 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2019-11-20 11:31:38,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:31:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2019-11-20 11:31:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 11:31:38,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:38,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:38,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:38,882 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:38,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash 584247255, now seen corresponding path program 1 times [2019-11-20 11:31:38,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:38,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [120522303] [2019-11-20 11:31:38,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:39,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 11:31:39,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:39,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:31:39,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:39,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:39,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:31:39,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:39,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:39,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:39,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 11:31:39,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:39,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 11:31:39,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:39,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:39,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:39,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:31:39,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:39,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:39,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:31:39,230 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-20 11:31:39,251 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 11:31:39,251 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:39,521 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 11:31:39,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [120522303] [2019-11-20 11:31:39,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:39,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 11:31:39,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074068299] [2019-11-20 11:31:39,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:31:39,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:39,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:31:39,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:31:39,523 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 6 states. [2019-11-20 11:31:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:39,963 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-11-20 11:31:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:31:39,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-20 11:31:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:39,964 INFO L225 Difference]: With dead ends: 67 [2019-11-20 11:31:39,964 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 11:31:39,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:31:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 11:31:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-11-20 11:31:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 11:31:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-11-20 11:31:39,970 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 15 [2019-11-20 11:31:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:39,970 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-11-20 11:31:39,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:31:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-11-20 11:31:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 11:31:39,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:39,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:40,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:40,176 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -618500523, now seen corresponding path program 1 times [2019-11-20 11:31:40,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:40,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [912446238] [2019-11-20 11:31:40,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:40,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 11:31:40,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:40,346 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 13 treesize of output 9 [2019-11-20 11:31:40,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:40,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:40,371 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 11:31:40,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:40,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:40,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:40,380 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-11-20 11:31:40,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 11:31:40,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:40,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:40,447 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 21 treesize of output 9 [2019-11-20 11:31:40,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:40,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:40,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:40,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:12 [2019-11-20 11:31:40,478 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 11:31:40,478 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:40,554 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 11:31:40,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [912446238] [2019-11-20 11:31:40,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:40,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-11-20 11:31:40,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118499677] [2019-11-20 11:31:40,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 11:31:40,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:40,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 11:31:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:31:40,556 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 9 states. [2019-11-20 11:31:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:40,937 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-20 11:31:40,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:31:40,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-20 11:31:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:40,938 INFO L225 Difference]: With dead ends: 71 [2019-11-20 11:31:40,939 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 11:31:40,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:31:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 11:31:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-11-20 11:31:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 11:31:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2019-11-20 11:31:40,944 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 18 [2019-11-20 11:31:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:40,944 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2019-11-20 11:31:40,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 11:31:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2019-11-20 11:31:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 11:31:40,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:40,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:41,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:41,146 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:41,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:41,146 INFO L82 PathProgramCache]: Analyzing trace with hash -618489538, now seen corresponding path program 1 times [2019-11-20 11:31:41,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:41,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1182054550] [2019-11-20 11:31:41,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:41,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 11:31:41,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:41,370 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 11:31:41,370 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:41,398 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 11:31:41,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1182054550] [2019-11-20 11:31:41,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:41,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-11-20 11:31:41,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652542156] [2019-11-20 11:31:41,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 11:31:41,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:31:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:31:41,400 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 7 states. [2019-11-20 11:31:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:41,611 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-20 11:31:41,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:31:41,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-20 11:31:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:41,613 INFO L225 Difference]: With dead ends: 75 [2019-11-20 11:31:41,613 INFO L226 Difference]: Without dead ends: 75 [2019-11-20 11:31:41,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:31:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-20 11:31:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2019-11-20 11:31:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-20 11:31:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2019-11-20 11:31:41,622 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 18 [2019-11-20 11:31:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:41,622 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2019-11-20 11:31:41,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 11:31:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2019-11-20 11:31:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:31:41,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:41,623 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 11:31:41,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:41,824 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:41,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:41,824 INFO L82 PathProgramCache]: Analyzing trace with hash 752239459, now seen corresponding path program 1 times [2019-11-20 11:31:41,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:41,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1957651722] [2019-11-20 11:31:41,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:41,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:31:41,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:42,041 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 11:31:42,041 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:42,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:42,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 14 treesize of output 12 [2019-11-20 11:31:42,124 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 11:31:42,134 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 11:31:42,135 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 11:31:42,145 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 11:31:42,146 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 11:31:42,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:42,202 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 11:31:42,202 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:35 [2019-11-20 11:31:42,313 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 11:31:42,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1957651722] [2019-11-20 11:31:42,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:42,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 11:31:42,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641086923] [2019-11-20 11:31:42,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:31:42,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:42,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:31:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:31:42,314 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 8 states. [2019-11-20 11:31:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:42,515 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2019-11-20 11:31:42,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:31:42,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-20 11:31:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:42,516 INFO L225 Difference]: With dead ends: 78 [2019-11-20 11:31:42,516 INFO L226 Difference]: Without dead ends: 78 [2019-11-20 11:31:42,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:31:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-20 11:31:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-11-20 11:31:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 11:31:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-11-20 11:31:42,521 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 19 [2019-11-20 11:31:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:42,521 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-11-20 11:31:42,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:31:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-11-20 11:31:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:31:42,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:42,522 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:31:42,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:42,726 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:42,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:42,726 INFO L82 PathProgramCache]: Analyzing trace with hash -12013416, now seen corresponding path program 1 times [2019-11-20 11:31:42,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:42,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2025059857] [2019-11-20 11:31:42,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:42,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 11:31:42,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:42,912 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 11 treesize of output 7 [2019-11-20 11:31:42,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:42,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:42,927 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 11 treesize of output 7 [2019-11-20 11:31:42,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:42,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:42,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:42,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-20 11:31:42,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:42,953 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 11:31:42,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:42,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:42,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:42,978 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 11:31:42,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:42,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:42,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:42,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-20 11:31:43,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:43,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:43,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:43,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-20 11:31:43,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:43,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:43,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:43,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:43,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:43,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-20 11:31:43,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:43,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:43,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:43,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-11-20 11:31:43,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 11:31:43,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:43,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:43,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:43,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 11:31:43,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:43,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:43,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:43,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-20 11:31:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:43,253 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:43,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2025059857] [2019-11-20 11:31:43,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:31:43,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2019-11-20 11:31:43,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495397115] [2019-11-20 11:31:43,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 11:31:43,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:43,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 11:31:43,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 11:31:43,353 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 11 states. [2019-11-20 11:31:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:43,940 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2019-11-20 11:31:43,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:31:43,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-20 11:31:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:43,941 INFO L225 Difference]: With dead ends: 79 [2019-11-20 11:31:43,941 INFO L226 Difference]: Without dead ends: 79 [2019-11-20 11:31:43,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:31:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-20 11:31:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-11-20 11:31:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 11:31:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-11-20 11:31:43,947 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 21 [2019-11-20 11:31:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:43,947 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-11-20 11:31:43,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 11:31:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-11-20 11:31:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 11:31:43,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:43,948 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 11:31:44,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:44,152 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:44,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:44,152 INFO L82 PathProgramCache]: Analyzing trace with hash -372416797, now seen corresponding path program 1 times [2019-11-20 11:31:44,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:44,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1522041027] [2019-11-20 11:31:44,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:44,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 11:31:44,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:44,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:31:44,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:44,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:44,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:44,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:31:44,431 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 11:31:44,431 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:48,525 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 11:31:48,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1522041027] [2019-11-20 11:31:48,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:31:48,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-20 11:31:48,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018756582] [2019-11-20 11:31:48,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:31:48,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:48,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:31:48,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2019-11-20 11:31:48,527 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 10 states. [2019-11-20 11:31:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:48,976 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2019-11-20 11:31:48,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:31:48,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 11:31:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:48,977 INFO L225 Difference]: With dead ends: 77 [2019-11-20 11:31:48,977 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 11:31:48,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=52, Invalid=128, Unknown=2, NotChecked=0, Total=182 [2019-11-20 11:31:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 11:31:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-20 11:31:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 11:31:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-11-20 11:31:48,982 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 22 [2019-11-20 11:31:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:48,982 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-11-20 11:31:48,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:31:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-11-20 11:31:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 11:31:48,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:48,983 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 11:31:49,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:49,190 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:49,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1721400836, now seen corresponding path program 1 times [2019-11-20 11:31:49,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:49,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [84552694] [2019-11-20 11:31:49,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:49,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 11:31:49,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:49,388 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 13 treesize of output 9 [2019-11-20 11:31:49,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:49,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:49,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:49,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 11:31:49,456 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 15 treesize of output 7 [2019-11-20 11:31:49,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:49,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:49,459 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 11:31:49,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 11:31:49,469 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 11:31:49,469 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:49,520 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 11:31:49,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [84552694] [2019-11-20 11:31:49,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:49,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-11-20 11:31:49,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235220984] [2019-11-20 11:31:49,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:31:49,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:49,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:31:49,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:31:49,522 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 10 states. [2019-11-20 11:31:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:49,905 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2019-11-20 11:31:49,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:31:49,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-20 11:31:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:49,906 INFO L225 Difference]: With dead ends: 124 [2019-11-20 11:31:49,906 INFO L226 Difference]: Without dead ends: 124 [2019-11-20 11:31:49,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-11-20 11:31:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-20 11:31:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 66. [2019-11-20 11:31:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 11:31:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2019-11-20 11:31:49,910 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 24 [2019-11-20 11:31:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:49,910 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2019-11-20 11:31:49,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:31:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2019-11-20 11:31:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 11:31:49,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:49,911 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 11:31:50,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:50,112 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1823818468, now seen corresponding path program 1 times [2019-11-20 11:31:50,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:50,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1401609955] [2019-11-20 11:31:50,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:50,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 11:31:50,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:50,362 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 13 treesize of output 9 [2019-11-20 11:31:50,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:50,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:50,374 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 11:31:50,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-11-20 11:31:50,424 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 15 treesize of output 7 [2019-11-20 11:31:50,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:50,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:50,433 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 11:31:50,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-20 11:31:50,462 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 11:31:50,462 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:50,533 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 11:31:50,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1401609955] [2019-11-20 11:31:50,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:50,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 11 [2019-11-20 11:31:50,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793933953] [2019-11-20 11:31:50,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 11:31:50,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 11:31:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:31:50,535 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 12 states. [2019-11-20 11:31:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:51,303 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2019-11-20 11:31:51,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:31:51,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-11-20 11:31:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:51,305 INFO L225 Difference]: With dead ends: 123 [2019-11-20 11:31:51,305 INFO L226 Difference]: Without dead ends: 123 [2019-11-20 11:31:51,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:31:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-20 11:31:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 66. [2019-11-20 11:31:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 11:31:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2019-11-20 11:31:51,309 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 25 [2019-11-20 11:31:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:51,309 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2019-11-20 11:31:51,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 11:31:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2019-11-20 11:31:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 11:31:51,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:51,310 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 11:31:51,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:51,512 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash 703797766, now seen corresponding path program 1 times [2019-11-20 11:31:51,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:51,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1703103214] [2019-11-20 11:31:51,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:51,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 11:31:51,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:51,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:31:51,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:51,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:51,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:51,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:31:51,831 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 13 treesize of output 9 [2019-11-20 11:31:51,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:51,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:51,844 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 11:31:51,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-20 11:31:51,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 11:31:51,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:51,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:51,890 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 11:31:51,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:5 [2019-11-20 11:31:51,909 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 11:31:51,909 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:51,988 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 11:31:51,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1703103214] [2019-11-20 11:31:51,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:51,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-11-20 11:31:51,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315495175] [2019-11-20 11:31:51,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:31:51,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:31:51,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:31:51,990 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 10 states. [2019-11-20 11:31:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:52,406 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2019-11-20 11:31:52,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:31:52,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-20 11:31:52,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:52,408 INFO L225 Difference]: With dead ends: 81 [2019-11-20 11:31:52,408 INFO L226 Difference]: Without dead ends: 81 [2019-11-20 11:31:52,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:31:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-20 11:31:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66. [2019-11-20 11:31:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 11:31:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2019-11-20 11:31:52,412 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 26 [2019-11-20 11:31:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:52,412 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2019-11-20 11:31:52,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:31:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2019-11-20 11:31:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 11:31:52,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:52,413 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] [2019-11-20 11:31:52,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:52,617 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:52,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash 670158473, now seen corresponding path program 1 times [2019-11-20 11:31:52,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:52,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [651061926] [2019-11-20 11:31:52,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:52,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 11:31:52,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:52,814 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 13 treesize of output 9 [2019-11-20 11:31:52,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:52,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:52,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:52,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 11:31:52,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 11:31:52,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:52,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:52,849 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 11:31:52,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-20 11:31:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:52,861 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:53,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [651061926] [2019-11-20 11:31:53,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:31:53,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 11:31:53,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686877422] [2019-11-20 11:31:53,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 11:31:53,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:53,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 11:31:53,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:31:53,008 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 12 states. [2019-11-20 11:31:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:31:53,389 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2019-11-20 11:31:53,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:31:53,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-20 11:31:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:31:53,390 INFO L225 Difference]: With dead ends: 85 [2019-11-20 11:31:53,390 INFO L226 Difference]: Without dead ends: 85 [2019-11-20 11:31:53,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:31:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-20 11:31:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-11-20 11:31:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 11:31:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-11-20 11:31:53,393 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 27 [2019-11-20 11:31:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:31:53,394 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-11-20 11:31:53,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 11:31:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-11-20 11:31:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 11:31:53,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:31:53,395 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] [2019-11-20 11:31:53,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:31:53,598 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:31:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:31:53,598 INFO L82 PathProgramCache]: Analyzing trace with hash 970317609, now seen corresponding path program 1 times [2019-11-20 11:31:53,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:31:53,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1030081087] [2019-11-20 11:31:53,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:31:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:31:53,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 11:31:53,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:31:53,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:31:53,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:53,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:53,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:53,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:31:53,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:53,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 11:31:53,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:53,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:53,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:53,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-11-20 11:31:53,885 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 11 treesize of output 7 [2019-11-20 11:31:53,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:53,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:53,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:53,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-20 11:31:53,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:53,939 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 1 case distinctions, treesize of input 41 treesize of output 59 [2019-11-20 11:31:53,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:31:53,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:31:53,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:31:53,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 11:31:53,978 INFO L567 ElimStorePlain]: treesize reduction 38, result has 47.9 percent of original size [2019-11-20 11:31:53,979 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 11:31:53,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-11-20 11:31:54,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:31:54,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:54,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 89 [2019-11-20 11:31:54,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:54,090 INFO L567 ElimStorePlain]: treesize reduction 46, result has 49.5 percent of original size [2019-11-20 11:31:54,090 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 11:31:54,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:45 [2019-11-20 11:31:54,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:54,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-11-20 11:31:54,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:54,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:54,246 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 11:31:54,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:12 [2019-11-20 11:31:54,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 11:31:54,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:54,308 INFO L567 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-11-20 11:31:54,308 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 11:31:54,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2019-11-20 11:31:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:54,337 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:31:54,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:31:54,479 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:54,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 11:31:54,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:31:54,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:54,488 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 25 treesize of output 23 [2019-11-20 11:31:54,489 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:54,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:54,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 11:31:54,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:36 [2019-11-20 11:31:54,568 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:31:54,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:31:54,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:31:54,574 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 11:31:54,586 INFO L567 ElimStorePlain]: treesize reduction 22, result has 15.4 percent of original size [2019-11-20 11:31:54,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:31:54,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:4 [2019-11-20 11:31:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:31:54,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1030081087] [2019-11-20 11:31:54,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:31:54,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2019-11-20 11:31:54,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695556382] [2019-11-20 11:31:54,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 11:31:54,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:31:54,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 11:31:54,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:31:54,620 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 18 states. [2019-11-20 11:32:16,531 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-11-20 11:32:16,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:32:16,992 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-11-20 11:32:16,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-20 11:32:16,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-11-20 11:32:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:32:16,993 INFO L225 Difference]: With dead ends: 98 [2019-11-20 11:32:16,993 INFO L226 Difference]: Without dead ends: 98 [2019-11-20 11:32:16,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=388, Invalid=1252, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 11:32:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-20 11:32:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2019-11-20 11:32:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 11:32:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-11-20 11:32:16,997 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 27 [2019-11-20 11:32:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:32:16,997 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-11-20 11:32:16,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 11:32:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-11-20 11:32:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 11:32:16,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:32:16,998 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] [2019-11-20 11:32:17,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:32:17,205 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:32:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:32:17,206 INFO L82 PathProgramCache]: Analyzing trace with hash 970317610, now seen corresponding path program 1 times [2019-11-20 11:32:17,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:32:17,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1824104053] [2019-11-20 11:32:17,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:32:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:32:17,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 11:32:17,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:32:17,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:32:17,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:32:17,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 11:32:17,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:32:17,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 11:32:17,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 11:32:17,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2019-11-20 11:32:17,611 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 11 treesize of output 7 [2019-11-20 11:32:17,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,634 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 11 treesize of output 7 [2019-11-20 11:32:17,634 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,652 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2019-11-20 11:32:17,681 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2019-11-20 11:32:17,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,705 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 27 treesize of output 22 [2019-11-20 11:32:17,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:57 [2019-11-20 11:32:17,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:32:17,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:32:17,761 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2019-11-20 11:32:17,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:32:17,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-11-20 11:32:17,795 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:77 [2019-11-20 11:32:17,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 29 [2019-11-20 11:32:17,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 11:32:17,940 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:17,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:17,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:32:17,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:20 [2019-11-20 11:32:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:32:18,014 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:32:18,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:18,759 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 11:32:18,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:18,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:19,060 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-11-20 11:32:19,060 INFO L567 ElimStorePlain]: treesize reduction 59, result has 63.6 percent of original size [2019-11-20 11:32:19,070 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:19,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:19,167 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:32:19,359 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 11:32:19,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:32:19,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 11:32:19,360 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:166, output treesize:97 [2019-11-20 11:32:19,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:19,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:32:19,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:32:19,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:32:19,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:32:19,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:32:19,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:32:19,938 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-11-20 11:32:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:32:20,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1824104053] [2019-11-20 11:32:20,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:32:20,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2019-11-20 11:32:20,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814864901] [2019-11-20 11:32:20,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 11:32:20,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:32:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 11:32:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-11-20 11:32:20,186 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 19 states. [2019-11-20 11:32:20,960 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-20 11:32:21,642 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-11-20 11:32:22,213 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-11-20 11:32:22,410 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-11-20 11:32:22,569 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-20 11:32:23,055 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-11-20 11:32:23,402 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-11-20 11:32:23,682 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-11-20 11:33:11,752 WARN L191 SmtUtils]: Spent 42.86 s on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-11-20 11:33:16,469 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-20 11:33:19,533 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-11-20 11:33:22,409 WARN L191 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-11-20 11:33:22,635 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-11-20 11:33:25,126 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2019-11-20 11:33:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:31,369 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2019-11-20 11:33:31,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-20 11:33:31,369 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-11-20 11:33:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:31,370 INFO L225 Difference]: With dead ends: 102 [2019-11-20 11:33:31,370 INFO L226 Difference]: Without dead ends: 102 [2019-11-20 11:33:31,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 59.0s TimeCoverageRelationStatistics Valid=561, Invalid=1329, Unknown=2, NotChecked=0, Total=1892 [2019-11-20 11:33:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-20 11:33:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2019-11-20 11:33:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 11:33:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-11-20 11:33:31,373 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 27 [2019-11-20 11:33:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:31,373 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-11-20 11:33:31,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 11:33:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-11-20 11:33:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 11:33:31,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:31,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:31,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:31,575 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:33:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:31,575 INFO L82 PathProgramCache]: Analyzing trace with hash 15073906, now seen corresponding path program 1 times [2019-11-20 11:33:31,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:31,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [727107755] [2019-11-20 11:33:31,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:33:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:31,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 11:33:31,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:31,801 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 6 treesize of output 5 [2019-11-20 11:33:31,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:31,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:31,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:31,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-11-20 11:33:31,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:31,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 11:33:31,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:31,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:31,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:31,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2019-11-20 11:33:31,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:33:31,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:31,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:31,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:31,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-20 11:33:31,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:31,900 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 1 case distinctions, treesize of input 38 treesize of output 56 [2019-11-20 11:33:31,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:33:31,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:33:31,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 11:33:31,936 INFO L567 ElimStorePlain]: treesize reduction 37, result has 47.9 percent of original size [2019-11-20 11:33:31,937 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 11:33:31,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-11-20 11:33:31,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:33:31,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:31,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 88 [2019-11-20 11:33:31,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:32,040 INFO L567 ElimStorePlain]: treesize reduction 46, result has 47.7 percent of original size [2019-11-20 11:33:32,040 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 11:33:32,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2019-11-20 11:33:32,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:32,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2019-11-20 11:33:32,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:32,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:32,184 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 11:33:32,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2019-11-20 11:33:32,218 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 11:33:32,218 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:32,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 11:33:32,320 INFO L567 ElimStorePlain]: treesize reduction 26, result has 13.3 percent of original size [2019-11-20 11:33:32,320 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 11:33:32,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:4 [2019-11-20 11:33:32,384 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 11:33:32,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [727107755] [2019-11-20 11:33:32,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:33:32,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-20 11:33:32,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735912668] [2019-11-20 11:33:32,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 11:33:32,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:32,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 11:33:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:33:32,386 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 16 states. [2019-11-20 11:33:35,208 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-20 11:33:41,939 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-20 11:33:42,550 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-20 11:33:44,755 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-11-20 11:33:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:33:51,062 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2019-11-20 11:33:51,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-20 11:33:51,062 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-11-20 11:33:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:33:51,063 INFO L225 Difference]: With dead ends: 107 [2019-11-20 11:33:51,063 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 11:33:51,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=493, Invalid=1147, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 11:33:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 11:33:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2019-11-20 11:33:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 11:33:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2019-11-20 11:33:51,066 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 28 [2019-11-20 11:33:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:33:51,066 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2019-11-20 11:33:51,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 11:33:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2019-11-20 11:33:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 11:33:51,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:33:51,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:33:51,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:33:51,271 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:33:51,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:33:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1190981877, now seen corresponding path program 1 times [2019-11-20 11:33:51,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:33:51,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1954020753] [2019-11-20 11:33:51,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:33:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:33:51,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 11:33:51,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:33:51,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:51,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 11:33:51,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:51,541 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-20 11:33:51,541 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 11:33:51,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-20 11:33:51,563 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:51,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 11:33:51,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:51,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:51,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:51,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-20 11:33:51,582 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 13 treesize of output 9 [2019-11-20 11:33:51,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:51,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:51,592 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 11:33:51,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-20 11:33:51,636 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 16 treesize of output 8 [2019-11-20 11:33:51,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:51,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:51,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:51,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-20 11:33:51,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 11:33:51,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:51,684 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-20 11:33:51,685 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 11:33:51,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-20 11:33:51,709 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 11:33:51,709 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:33:51,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:33:51,782 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 6 treesize of output 4 [2019-11-20 11:33:51,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:33:51,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:33:51,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:33:51,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-20 11:33:51,819 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 11:33:51,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1954020753] [2019-11-20 11:33:51,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:33:51,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2019-11-20 11:33:51,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407214332] [2019-11-20 11:33:51,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 11:33:51,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:33:51,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 11:33:51,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-20 11:33:51,820 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 13 states. [2019-11-20 11:34:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:34:22,459 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-11-20 11:34:22,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 11:34:22,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-11-20 11:34:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:34:22,460 INFO L225 Difference]: With dead ends: 82 [2019-11-20 11:34:22,460 INFO L226 Difference]: Without dead ends: 82 [2019-11-20 11:34:22,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-11-20 11:34:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-20 11:34:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2019-11-20 11:34:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 11:34:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2019-11-20 11:34:22,462 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 29 [2019-11-20 11:34:22,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:34:22,463 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2019-11-20 11:34:22,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 11:34:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2019-11-20 11:34:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 11:34:22,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:34:22,464 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:34:22,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:34:22,669 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:34:22,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:34:22,669 INFO L82 PathProgramCache]: Analyzing trace with hash 467320011, now seen corresponding path program 1 times [2019-11-20 11:34:22,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:34:22,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1393236594] [2019-11-20 11:34:22,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:34:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:34:22,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 11:34:22,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:34:22,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:34:22,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:22,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:22,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:34:22,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:22,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:22,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:34:22,961 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 11:34:22,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:22,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 11:34:22,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 11:34:23,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,013 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2019-11-20 11:34:23,034 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 11 treesize of output 7 [2019-11-20 11:34:23,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,071 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 11 treesize of output 7 [2019-11-20 11:34:23,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,087 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2019-11-20 11:34:23,122 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 27 treesize of output 22 [2019-11-20 11:34:23,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,149 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2019-11-20 11:34:23,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,166 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:57 [2019-11-20 11:34:23,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:34:23,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:34:23,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2019-11-20 11:34:23,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:34:23,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-11-20 11:34:23,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:77 [2019-11-20 11:34:23,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 29 [2019-11-20 11:34:23,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-11-20 11:34:23,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:22 [2019-11-20 11:34:23,561 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 6 treesize of output 5 [2019-11-20 11:34:23,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:23,572 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 11:34:23,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2019-11-20 11:34:23,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:34:23,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:23,676 INFO L567 ElimStorePlain]: treesize reduction 15, result has 59.5 percent of original size [2019-11-20 11:34:23,677 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 11:34:23,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:22 [2019-11-20 11:34:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:34:23,725 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:34:24,052 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 35 treesize of output 33 [2019-11-20 11:34:24,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:24,067 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 35 treesize of output 33 [2019-11-20 11:34:24,067 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:24,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-20 11:34:24,075 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:24,213 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-20 11:34:24,213 INFO L567 ElimStorePlain]: treesize reduction 10, result has 88.4 percent of original size [2019-11-20 11:34:24,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-20 11:34:24,214 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:104, output treesize:76 [2019-11-20 11:34:25,665 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 11:34:25,703 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:34:25,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:26,029 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-20 11:34:26,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:26,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:26,615 WARN L191 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-11-20 11:34:26,616 INFO L567 ElimStorePlain]: treesize reduction 51, result has 91.2 percent of original size [2019-11-20 11:34:26,621 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:34:26,623 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:26,811 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 11:34:26,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:26,828 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:27,121 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-11-20 11:34:27,122 INFO L567 ElimStorePlain]: treesize reduction 79, result has 78.4 percent of original size [2019-11-20 11:34:27,133 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:27,373 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-11-20 11:34:27,373 INFO L567 ElimStorePlain]: treesize reduction 81, result has 73.6 percent of original size [2019-11-20 11:34:27,379 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:34:27,379 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:27,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:27,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 11:34:27,428 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:676, output treesize:76 [2019-11-20 11:34:27,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:34:27,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1393236594] [2019-11-20 11:34:27,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:34:27,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2019-11-20 11:34:27,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402927151] [2019-11-20 11:34:27,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 11:34:27,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:34:27,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 11:34:27,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-11-20 11:34:27,976 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 26 states. [2019-11-20 11:34:29,479 WARN L191 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-11-20 11:34:30,077 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-20 11:34:31,851 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-20 11:34:32,383 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-20 11:34:34,505 WARN L191 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2019-11-20 11:34:35,096 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-20 11:34:35,246 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-11-20 11:34:35,426 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-20 11:34:36,536 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-11-20 11:34:37,470 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-20 11:34:38,430 WARN L191 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-20 11:34:38,825 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-11-20 11:34:40,395 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-11-20 11:34:41,596 WARN L191 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-11-20 11:34:42,051 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 11:34:42,728 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 11:34:43,934 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 11:34:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:34:44,108 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-11-20 11:34:44,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-20 11:34:44,109 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-11-20 11:34:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:34:44,110 INFO L225 Difference]: With dead ends: 112 [2019-11-20 11:34:44,110 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 11:34:44,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=790, Invalid=2180, Unknown=0, NotChecked=0, Total=2970 [2019-11-20 11:34:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 11:34:44,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 83. [2019-11-20 11:34:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-20 11:34:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2019-11-20 11:34:44,114 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 29 [2019-11-20 11:34:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:34:44,114 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2019-11-20 11:34:44,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 11:34:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2019-11-20 11:34:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 11:34:44,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:34:44,115 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, 1, 1] [2019-11-20 11:34:44,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:34:44,319 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:34:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:34:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2072280274, now seen corresponding path program 1 times [2019-11-20 11:34:44,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:34:44,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1380606103] [2019-11-20 11:34:44,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6684c0b5-e3fe-4da5-a1ac-96a6b4f3f419/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 11:34:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:34:44,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 11:34:44,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:34:44,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 11:34:44,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:44,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:44,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:34:44,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:34:44,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:44,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 11:34:44,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:44,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:44,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:34:44,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-11-20 11:34:44,652 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 11 treesize of output 7 [2019-11-20 11:34:44,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:44,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:44,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:34:44,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-20 11:34:44,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:44,701 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 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-20 11:34:44,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:44,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:44,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:44,714 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 11:34:44,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2019-11-20 11:34:44,763 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:44,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 61 [2019-11-20 11:34:44,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:44,805 INFO L567 ElimStorePlain]: treesize reduction 26, result has 64.4 percent of original size [2019-11-20 11:34:44,805 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 11:34:44,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:47 [2019-11-20 11:34:44,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:34:44,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:44,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 95 [2019-11-20 11:34:44,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:44,942 INFO L567 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-11-20 11:34:44,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:44,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:61 [2019-11-20 11:34:45,228 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:45,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 61 [2019-11-20 11:34:45,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:45,248 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-20 11:34:45,248 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 11:34:45,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:21 [2019-11-20 11:34:45,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-11-20 11:34:45,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:45,299 INFO L567 ElimStorePlain]: treesize reduction 4, result has 81.0 percent of original size [2019-11-20 11:34:45,300 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 11:34:45,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:17 [2019-11-20 11:34:45,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:45,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-20 11:34:45,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:45,387 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-20 11:34:45,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:45,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:18 [2019-11-20 11:34:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:34:45,435 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:34:45,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:45,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 123 [2019-11-20 11:34:45,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:45,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:34:45,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:45,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:34:45,889 INFO L567 ElimStorePlain]: treesize reduction 69, result has 42.0 percent of original size [2019-11-20 11:34:45,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:45,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:34:45,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:50 [2019-11-20 11:34:45,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:45,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:46,049 INFO L343 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2019-11-20 11:34:46,049 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 35 [2019-11-20 11:34:46,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:34:46,079 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-20 11:34:46,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:34:46,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 11:34:46,085 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_104], 1=[v_arrayElimCell_103]} [2019-11-20 11:34:46,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:34:46,290 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 11:34:46,293 INFO L168 Benchmark]: Toolchain (without parser) took 192654.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.4 MB). Free memory was 946.1 MB in the beginning and 860.2 MB in the end (delta: 85.9 MB). Peak memory consumption was 375.3 MB. Max. memory is 11.5 GB. [2019-11-20 11:34:46,293 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:34:46,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:34:46,294 INFO L168 Benchmark]: Boogie Preprocessor took 57.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:34:46,294 INFO L168 Benchmark]: RCFGBuilder took 728.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:34:46,294 INFO L168 Benchmark]: TraceAbstraction took 191227.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.0 GB in the beginning and 860.2 MB in the end (delta: 186.5 MB). Peak memory consumption was 346.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:34:46,295 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 634.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 728.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 191227.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.0 GB in the beginning and 860.2 MB in the end (delta: 186.5 MB). Peak memory consumption was 346.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...