./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.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_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 f711e8fa055cb799c5be49ac147c434ba7c6e879 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no XNF --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 00:03:48,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:03:48,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:03:48,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:03:48,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:03:48,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:03:48,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:03:48,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:03:48,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:03:48,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:03:48,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:03:48,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:03:48,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:03:48,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:03:48,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:03:48,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:03:48,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:03:48,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:03:48,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:03:48,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:03:48,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:03:48,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:03:48,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:03:48,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:03:48,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:03:48,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:03:48,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:03:48,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:03:48,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:03:48,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:03:48,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:03:48,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:03:48,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:03:48,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:03:48,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:03:48,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:03:48,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:03:48,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:03:48,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:03:48,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:03:48,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:03:48,846 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 00:03:48,865 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:03:48,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:03:48,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:03:48,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:03:48,866 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:03:48,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:03:48,867 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:03:48,867 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 00:03:48,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:03:48,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:03:48,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:03:48,867 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 00:03:48,868 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 00:03:48,868 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 00:03:48,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:03:48,868 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 00:03:48,868 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 00:03:48,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:03:48,869 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:03:48,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:03:48,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:03:48,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:03:48,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:03:48,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:03:48,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:03:48,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:03:48,870 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 00:03:48,870 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 00:03:48,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:03:48,871 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_d9a665a2-a452-4e25-8509-8542a708bd0b/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 -> f711e8fa055cb799c5be49ac147c434ba7c6e879 [2019-11-20 00:03:49,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:03:49,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:03:49,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:03:49,052 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:03:49,053 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:03:49,054 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2019-11-20 00:03:49,109 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/data/aa67b2e10/a3134aaed0b94aeda5fc48e96121b173/FLAG0b9e0fe68 [2019-11-20 00:03:49,617 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:03:49,618 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2019-11-20 00:03:49,642 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/data/aa67b2e10/a3134aaed0b94aeda5fc48e96121b173/FLAG0b9e0fe68 [2019-11-20 00:03:49,918 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/bin/uautomizer/data/aa67b2e10/a3134aaed0b94aeda5fc48e96121b173 [2019-11-20 00:03:49,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:03:49,922 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 00:03:49,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:03:49,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:03:49,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:03:49,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:03:49" (1/1) ... [2019-11-20 00:03:49,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157d9c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:49, skipping insertion in model container [2019-11-20 00:03:49,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:03:49" (1/1) ... [2019-11-20 00:03:49,938 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:03:49,981 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:03:50,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:03:50,399 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:03:50,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:03:50,503 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:03:50,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50 WrapperNode [2019-11-20 00:03:50,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:03:50,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:03:50,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:03:50,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:03:50,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50" (1/1) ... [2019-11-20 00:03:50,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50" (1/1) ... [2019-11-20 00:03:50,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50" (1/1) ... [2019-11-20 00:03:50,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50" (1/1) ... [2019-11-20 00:03:50,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50" (1/1) ... [2019-11-20 00:03:50,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50" (1/1) ... [2019-11-20 00:03:50,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50" (1/1) ... [2019-11-20 00:03:50,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:03:50,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:03:50,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:03:50,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:03:50,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 00:03:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:03:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 00:03:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 00:03:50,647 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-20 00:03:50,648 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-20 00:03:50,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 00:03:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 00:03:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 00:03:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 00:03:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 00:03:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 00:03:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 00:03:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 00:03:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 00:03:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 00:03:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 00:03:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 00:03:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 00:03:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 00:03:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 00:03:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 00:03:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 00:03:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 00:03:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 00:03:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 00:03:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 00:03:50,654 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 00:03:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 00:03:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 00:03:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 00:03:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 00:03:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 00:03:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 00:03:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 00:03:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 00:03:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 00:03:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 00:03:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 00:03:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 00:03:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 00:03:50,656 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 00:03:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 00:03:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 00:03:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 00:03:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 00:03:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 00:03:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 00:03:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 00:03:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 00:03:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 00:03:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 00:03:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 00:03:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 00:03:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 00:03:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 00:03:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 00:03:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 00:03:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 00:03:50,659 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 00:03:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 00:03:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 00:03:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 00:03:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 00:03:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 00:03:50,660 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 00:03:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 00:03:50,661 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 00:03:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 00:03:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 00:03:50,662 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 00:03:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 00:03:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 00:03:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 00:03:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 00:03:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 00:03:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 00:03:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 00:03:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 00:03:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 00:03:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 00:03:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 00:03:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 00:03:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 00:03:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 00:03:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 00:03:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 00:03:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 00:03:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 00:03:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 00:03:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 00:03:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 00:03:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 00:03:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 00:03:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 00:03:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 00:03:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 00:03:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 00:03:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 00:03:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 00:03:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 00:03:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 00:03:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 00:03:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 00:03:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 00:03:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 00:03:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 00:03:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 00:03:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 00:03:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 00:03:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 00:03:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 00:03:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 00:03:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-20 00:03:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-20 00:03:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 00:03:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 00:03:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 00:03:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 00:03:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 00:03:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 00:03:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:03:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 00:03:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:03:51,454 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-20 00:03:51,667 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:03:51,667 INFO L285 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 00:03:51,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:03:51 BoogieIcfgContainer [2019-11-20 00:03:51,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:03:51,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:03:51,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:03:51,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:03:51,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:03:49" (1/3) ... [2019-11-20 00:03:51,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45400bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:03:51, skipping insertion in model container [2019-11-20 00:03:51,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:50" (2/3) ... [2019-11-20 00:03:51,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45400bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:03:51, skipping insertion in model container [2019-11-20 00:03:51,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:03:51" (3/3) ... [2019-11-20 00:03:51,677 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2019-11-20 00:03:51,686 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:03:51,693 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2019-11-20 00:03:51,702 INFO L249 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2019-11-20 00:03:51,722 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:03:51,722 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 00:03:51,722 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:03:51,722 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:03:51,722 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:03:51,723 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:03:51,723 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:03:51,723 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:03:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-20 00:03:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 00:03:51,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:51,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:03:51,748 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:03:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1786956164, now seen corresponding path program 1 times [2019-11-20 00:03:51,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:03:51,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1335514686] [2019-11-20 00:03:51,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:52,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:03:52,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:03:52,094 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 00:03:52,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:52,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:52,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:03:52,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 00:03:52,110 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 00:03:52,110 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:03:52,123 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 00:03:52,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1335514686] [2019-11-20 00:03:52,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:52,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 00:03:52,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600489212] [2019-11-20 00:03:52,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:52,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:03:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:52,143 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-11-20 00:03:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:52,371 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2019-11-20 00:03:52,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:52,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 00:03:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:52,386 INFO L225 Difference]: With dead ends: 80 [2019-11-20 00:03:52,386 INFO L226 Difference]: Without dead ends: 73 [2019-11-20 00:03:52,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 00:03:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-20 00:03:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-20 00:03:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-20 00:03:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-11-20 00:03:52,450 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 10 [2019-11-20 00:03:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:52,451 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-11-20 00:03:52,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-11-20 00:03:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 00:03:52,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:52,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:03:52,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:03:52,665 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:03:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1786956165, now seen corresponding path program 1 times [2019-11-20 00:03:52,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:03:52,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1557898352] [2019-11-20 00:03:52,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:52,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:03:52,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:03:52,878 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 00:03:52,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:52,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:52,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:03:52,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:03:52,903 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 00:03:52,904 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:03:52,959 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 00:03:52,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1557898352] [2019-11-20 00:03:52,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:52,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 00:03:52,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842341839] [2019-11-20 00:03:52,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:03:52,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:03:52,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:03:52,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:03:52,962 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-11-20 00:03:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:53,246 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-20 00:03:53,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:53,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 00:03:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:53,249 INFO L225 Difference]: With dead ends: 69 [2019-11-20 00:03:53,249 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 00:03:53,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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 00:03:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 00:03:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-20 00:03:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-20 00:03:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-20 00:03:53,259 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 10 [2019-11-20 00:03:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:53,259 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-20 00:03:53,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:03:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-20 00:03:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:03:53,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:53,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:03:53,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:03:53,466 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:03:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash -353694351, now seen corresponding path program 1 times [2019-11-20 00:03:53,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:03:53,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [275406874] [2019-11-20 00:03:53,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:53,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:03:53,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:03:53,706 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 00:03:53,707 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:03:53,747 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 00:03:53,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [275406874] [2019-11-20 00:03:53,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:53,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 00:03:53,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347151492] [2019-11-20 00:03:53,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:03:53,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:03:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:03:53,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:03:53,750 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 8 states. [2019-11-20 00:03:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:53,823 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-11-20 00:03:53,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:03:53,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-20 00:03:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:53,835 INFO L225 Difference]: With dead ends: 82 [2019-11-20 00:03:53,835 INFO L226 Difference]: Without dead ends: 82 [2019-11-20 00:03:53,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:03:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-20 00:03:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2019-11-20 00:03:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 00:03:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-20 00:03:53,843 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 16 [2019-11-20 00:03:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:53,843 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-20 00:03:53,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:03:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-20 00:03:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:03:53,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:53,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:03:54,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:03:54,051 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:03:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash -353692910, now seen corresponding path program 1 times [2019-11-20 00:03:54,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:03:54,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [507908873] [2019-11-20 00:03:54,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:54,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:03:54,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:03:54,300 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:54,300 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 00:03:54,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:54,325 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 00:03:54,326 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 00:03:54,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-20 00:03:54,343 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 00:03:54,344 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:03:54,351 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 00:03:54,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [507908873] [2019-11-20 00:03:54,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:54,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2019-11-20 00:03:54,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513504417] [2019-11-20 00:03:54,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:03:54,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:03:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:03:54,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:03:54,353 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 4 states. [2019-11-20 00:03:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:54,581 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-20 00:03:54,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:03:54,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-20 00:03:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:54,583 INFO L225 Difference]: With dead ends: 80 [2019-11-20 00:03:54,583 INFO L226 Difference]: Without dead ends: 80 [2019-11-20 00:03:54,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 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 00:03:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-20 00:03:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2019-11-20 00:03:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 00:03:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2019-11-20 00:03:54,591 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 16 [2019-11-20 00:03:54,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:54,592 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2019-11-20 00:03:54,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:03:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2019-11-20 00:03:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:03:54,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:54,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:03:54,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:03:54,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:03:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash -353692909, now seen corresponding path program 1 times [2019-11-20 00:03:54,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:03:54,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [60520703] [2019-11-20 00:03:54,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:55,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:03:55,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:03:55,027 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 00:03:55,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:55,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:55,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:03:55,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:03:55,045 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 00:03:55,045 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:03:55,083 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 00:03:55,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [60520703] [2019-11-20 00:03:55,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:55,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 00:03:55,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069381384] [2019-11-20 00:03:55,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:03:55,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:03:55,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:03:55,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:03:55,085 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 4 states. [2019-11-20 00:03:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:55,356 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-11-20 00:03:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:55,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-20 00:03:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:55,359 INFO L225 Difference]: With dead ends: 72 [2019-11-20 00:03:55,359 INFO L226 Difference]: Without dead ends: 72 [2019-11-20 00:03:55,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 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 00:03:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-20 00:03:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-20 00:03:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-20 00:03:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-11-20 00:03:55,367 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 16 [2019-11-20 00:03:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:55,367 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-11-20 00:03:55,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:03:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-11-20 00:03:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:03:55,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:55,369 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 00:03:55,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:03:55,571 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:03:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:55,571 INFO L82 PathProgramCache]: Analyzing trace with hash -596469899, now seen corresponding path program 1 times [2019-11-20 00:03:55,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:03:55,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1822205581] [2019-11-20 00:03:55,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:55,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:03:55,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:03:55,834 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 00:03:55,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:55,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:55,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:03:55,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 00:03:55,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:55,878 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 14 treesize of output 30 [2019-11-20 00:03:55,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:55,907 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 00:03:55,908 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 00:03:55,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 00:03:55,920 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 00:03:55,921 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:03:55,942 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 00:03:55,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1822205581] [2019-11-20 00:03:55,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:55,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 00:03:55,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14629387] [2019-11-20 00:03:55,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:03:55,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:03:55,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:03:55,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:03:55,944 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 4 states. [2019-11-20 00:03:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:56,166 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-20 00:03:56,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:03:56,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 00:03:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:56,167 INFO L225 Difference]: With dead ends: 73 [2019-11-20 00:03:56,167 INFO L226 Difference]: Without dead ends: 73 [2019-11-20 00:03:56,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 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 00:03:56,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-20 00:03:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-11-20 00:03:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-20 00:03:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2019-11-20 00:03:56,172 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 18 [2019-11-20 00:03:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:56,173 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2019-11-20 00:03:56,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:03:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2019-11-20 00:03:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:03:56,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:56,174 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 00:03:56,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:03:56,375 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:03:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash -596469898, now seen corresponding path program 1 times [2019-11-20 00:03:56,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:03:56,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [351173952] [2019-11-20 00:03:56,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:56,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:03:56,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:03:56,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 00:03:56,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:56,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:56,602 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 00:03:56,602 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:56,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:56,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:03:56,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 00:03:56,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:56,672 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 00:03:56,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:56,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:56,694 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 00:03:56,695 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:56,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:56,705 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 00:03:56,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-11-20 00:03:56,729 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 00:03:56,729 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:03:56,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:03:57,076 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 00:03:57,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [351173952] [2019-11-20 00:03:57,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 00:03:57,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849665304] [2019-11-20 00:03:57,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:03:57,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:03:57,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:03:57,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:03:57,079 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 8 states. [2019-11-20 00:03:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:58,035 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-20 00:03:58,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:03:58,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-20 00:03:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:58,038 INFO L225 Difference]: With dead ends: 72 [2019-11-20 00:03:58,038 INFO L226 Difference]: Without dead ends: 72 [2019-11-20 00:03:58,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:03:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-20 00:03:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-20 00:03:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-20 00:03:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-11-20 00:03:58,043 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 18 [2019-11-20 00:03:58,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:58,044 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-11-20 00:03:58,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:03:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-11-20 00:03:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 00:03:58,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:58,045 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:03:58,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:03:58,246 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:03:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:58,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1326843497, now seen corresponding path program 1 times [2019-11-20 00:03:58,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:03:58,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1816555347] [2019-11-20 00:03:58,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:58,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:03:58,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:03:58,567 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:58,567 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 00:03:58,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:58,588 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 00:03:58,588 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 00:03:58,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-20 00:03:58,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:58,652 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 14 treesize of output 30 [2019-11-20 00:03:58,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:58,676 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 00:03:58,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 00:03:58,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 00:03:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:58,692 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:03:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:58,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1816555347] [2019-11-20 00:03:58,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:03:58,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-11-20 00:03:58,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272065386] [2019-11-20 00:03:58,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:03:58,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:03:58,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:03:58,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:03:58,715 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2019-11-20 00:03:58,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:58,940 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-20 00:03:58,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:03:58,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-20 00:03:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:58,942 INFO L225 Difference]: With dead ends: 76 [2019-11-20 00:03:58,942 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 00:03:58,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:03:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 00:03:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2019-11-20 00:03:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-20 00:03:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-11-20 00:03:58,947 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 24 [2019-11-20 00:03:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:58,947 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-11-20 00:03:58,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:03:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-11-20 00:03:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 00:03:58,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:58,948 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:03:59,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:03:59,152 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:03:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:59,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1326843498, now seen corresponding path program 1 times [2019-11-20 00:03:59,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:03:59,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [527107443] [2019-11-20 00:03:59,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:03:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:59,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:03:59,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:03:59,471 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 00:03:59,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:59,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:59,484 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 00:03:59,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:59,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:59,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:03:59,491 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 00:03:59,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:03:59,531 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 00:03:59,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:59,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:59,556 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:59,556 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 00:03:59,557 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:03:59,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:03:59,567 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 00:03:59,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-11-20 00:03:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:59,596 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:03:59,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:03:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:59,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [527107443] [2019-11-20 00:03:59,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:03:59,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-20 00:03:59,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590829327] [2019-11-20 00:03:59,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:03:59,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:03:59,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:03:59,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:03:59,897 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 8 states. [2019-11-20 00:04:00,209 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-20 00:04:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:00,569 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-20 00:04:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:04:00,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-20 00:04:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:00,571 INFO L225 Difference]: With dead ends: 68 [2019-11-20 00:04:00,571 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 00:04:00,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:04:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 00:04:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-20 00:04:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 00:04:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-20 00:04:00,579 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 24 [2019-11-20 00:04:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:00,580 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-20 00:04:00,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:04:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-20 00:04:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 00:04:00,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:00,581 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:04:00,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:04:00,785 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:04:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash -211926149, now seen corresponding path program 1 times [2019-11-20 00:04:00,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:04:00,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1773230997] [2019-11-20 00:04:00,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:04:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:01,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:04:01,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:04:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:01,123 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:04:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:01,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1773230997] [2019-11-20 00:04:01,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:04:01,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-20 00:04:01,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64096475] [2019-11-20 00:04:01,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 00:04:01,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:04:01,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 00:04:01,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:04:01,362 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2019-11-20 00:04:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:01,625 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-11-20 00:04:01,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 00:04:01,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-11-20 00:04:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:01,631 INFO L225 Difference]: With dead ends: 84 [2019-11-20 00:04:01,631 INFO L226 Difference]: Without dead ends: 79 [2019-11-20 00:04:01,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:04:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-20 00:04:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2019-11-20 00:04:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 00:04:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-11-20 00:04:01,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 33 [2019-11-20 00:04:01,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:01,644 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-11-20 00:04:01,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 00:04:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-11-20 00:04:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 00:04:01,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:01,645 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:04:01,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:04:01,846 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:04:01,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash 850955783, now seen corresponding path program 2 times [2019-11-20 00:04:01,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:04:01,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [92748457] [2019-11-20 00:04:01,847 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:04:02,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 00:04:02,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:04:02,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:04:02,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:04:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:04:02,149 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:04:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:04:02,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [92748457] [2019-11-20 00:04:02,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:02,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2019-11-20 00:04:02,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205156297] [2019-11-20 00:04:02,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:04:02,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:04:02,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:04:02,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:04:02,222 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 7 states. [2019-11-20 00:04:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:02,631 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2019-11-20 00:04:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:04:02,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-11-20 00:04:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:02,633 INFO L225 Difference]: With dead ends: 78 [2019-11-20 00:04:02,633 INFO L226 Difference]: Without dead ends: 78 [2019-11-20 00:04:02,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:04:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-20 00:04:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2019-11-20 00:04:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 00:04:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-11-20 00:04:02,639 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 39 [2019-11-20 00:04:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:02,639 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-11-20 00:04:02,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:04:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-11-20 00:04:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 00:04:02,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:02,641 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:04:02,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:04:02,842 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:04:02,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:02,842 INFO L82 PathProgramCache]: Analyzing trace with hash 850955784, now seen corresponding path program 1 times [2019-11-20 00:04:02,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:04:02,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [176902992] [2019-11-20 00:04:02,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:04:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:03,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:04:03,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:04:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:03,270 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:04:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:03,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [176902992] [2019-11-20 00:04:03,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:04:03,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-20 00:04:03,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086571408] [2019-11-20 00:04:03,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 00:04:03,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:04:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 00:04:03,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:04:03,570 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 13 states. [2019-11-20 00:04:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:03,992 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-11-20 00:04:03,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 00:04:03,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-20 00:04:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:03,993 INFO L225 Difference]: With dead ends: 87 [2019-11-20 00:04:03,994 INFO L226 Difference]: Without dead ends: 82 [2019-11-20 00:04:03,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-11-20 00:04:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-20 00:04:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2019-11-20 00:04:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-20 00:04:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-11-20 00:04:03,998 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 39 [2019-11-20 00:04:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:03,999 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-11-20 00:04:03,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 00:04:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-11-20 00:04:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 00:04:04,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:04,000 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:04:04,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:04:04,201 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:04:04,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:04,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2120499308, now seen corresponding path program 2 times [2019-11-20 00:04:04,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:04:04,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [719307205] [2019-11-20 00:04:04,202 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:04:04,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:04:04,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:04:04,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 00:04:04,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:04:04,591 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 00:04:04,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:04,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:04,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:04:04,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:04:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:04:04,691 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:04:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:04:05,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [719307205] [2019-11-20 00:04:05,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:05,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 12 [2019-11-20 00:04:05,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485232069] [2019-11-20 00:04:05,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 00:04:05,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:04:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 00:04:05,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:04:05,198 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 13 states. [2019-11-20 00:04:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:06,193 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-11-20 00:04:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 00:04:06,194 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-11-20 00:04:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:06,194 INFO L225 Difference]: With dead ends: 85 [2019-11-20 00:04:06,195 INFO L226 Difference]: Without dead ends: 85 [2019-11-20 00:04:06,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-20 00:04:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-20 00:04:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2019-11-20 00:04:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-20 00:04:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-11-20 00:04:06,200 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 45 [2019-11-20 00:04:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:06,200 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-11-20 00:04:06,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 00:04:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-11-20 00:04:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 00:04:06,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:06,202 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 00:04:06,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:04:06,402 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:04:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1415878405, now seen corresponding path program 1 times [2019-11-20 00:04:06,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:04:06,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1300818197] [2019-11-20 00:04:06,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:04:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:06,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 00:04:06,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:04:06,971 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:06,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 00:04:06,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:06,994 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-20 00:04:06,995 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 00:04:06,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2019-11-20 00:04:07,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:07,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 71 [2019-11-20 00:04:07,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,149 INFO L567 ElimStorePlain]: treesize reduction 28, result has 52.5 percent of original size [2019-11-20 00:04:07,149 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 00:04:07,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:31 [2019-11-20 00:04:07,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:07,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 41 [2019-11-20 00:04:07,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:07,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19 [2019-11-20 00:04:07,353 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 00:04:07,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:07,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-20 00:04:07,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 00:04:07,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:07,435 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 00:04:07,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:15 [2019-11-20 00:04:07,526 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 11 [2019-11-20 00:04:07,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:07,538 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 00:04:07,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2019-11-20 00:04:07,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:04:07,579 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 11 [2019-11-20 00:04:07,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:07,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:11 [2019-11-20 00:04:07,669 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 00:04:07,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:07,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:07,673 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 00:04:07,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-20 00:04:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:07,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:04:08,225 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 00:04:08,650 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-20 00:04:09,141 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-20 00:04:09,745 WARN L191 SmtUtils]: Spent 603.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-20 00:04:09,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:09,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2019-11-20 00:04:09,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:09,900 INFO L567 ElimStorePlain]: treesize reduction 97, result has 1.0 percent of original size [2019-11-20 00:04:09,903 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_174|, |v_#memory_int_175|], 2=[|v_#memory_int_172|, |v_#memory_int_173|]} [2019-11-20 00:04:09,903 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_174| vanished before elimination [2019-11-20 00:04:09,903 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_175| vanished before elimination [2019-11-20 00:04:09,903 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_172| vanished before elimination [2019-11-20 00:04:09,904 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_173| vanished before elimination [2019-11-20 00:04:09,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:04:09,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:115, output treesize:1 [2019-11-20 00:04:09,995 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 00:04:09,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:09,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:04:09,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2019-11-20 00:04:10,035 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:04:10,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:10,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 00:04:10,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2019-11-20 00:04:10,214 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 00:04:10,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:10,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 00:04:10,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:37 [2019-11-20 00:04:10,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:10,727 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-11-20 00:04:10,727 INFO L567 ElimStorePlain]: treesize reduction 125, result has 29.8 percent of original size [2019-11-20 00:04:10,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:04:10,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:04:10,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:04:10,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-20 00:04:10,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:24 [2019-11-20 00:04:10,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:04:10,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:04:11,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:04:11,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:04:11,720 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:11,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 77 [2019-11-20 00:04:11,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:11,758 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:11,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2019-11-20 00:04:11,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:04:11,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:04:11,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 00:04:11,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:72, output treesize:7 [2019-11-20 00:04:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:11,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1300818197] [2019-11-20 00:04:11,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:04:11,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-20 00:04:11,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423393505] [2019-11-20 00:04:11,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-20 00:04:11,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:04:11,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-20 00:04:11,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2019-11-20 00:04:11,816 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 31 states. [2019-11-20 00:04:16,515 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-11-20 00:04:21,022 WARN L191 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-11-20 00:04:31,467 WARN L191 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-11-20 00:04:52,581 WARN L191 SmtUtils]: Spent 12.30 s on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-20 00:05:05,587 WARN L191 SmtUtils]: Spent 8.09 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-20 00:05:09,722 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-11-20 00:05:13,991 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-11-20 00:05:14,806 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-20 00:05:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:05:15,226 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-11-20 00:05:15,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 00:05:15,227 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2019-11-20 00:05:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:05:15,228 INFO L225 Difference]: With dead ends: 79 [2019-11-20 00:05:15,228 INFO L226 Difference]: Without dead ends: 79 [2019-11-20 00:05:15,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=332, Invalid=1645, Unknown=3, NotChecked=0, Total=1980 [2019-11-20 00:05:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-20 00:05:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-20 00:05:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-20 00:05:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-11-20 00:05:15,233 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 48 [2019-11-20 00:05:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:05:15,234 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-11-20 00:05:15,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-20 00:05:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-11-20 00:05:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 00:05:15,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:05:15,236 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 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 00:05:15,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:05:15,436 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:05:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:05:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash 448050078, now seen corresponding path program 1 times [2019-11-20 00:05:15,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:05:15,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1935677998] [2019-11-20 00:05:15,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:05:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:05:15,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 00:05:15,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:05:15,827 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 00:05:15,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:15,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:15,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:15,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:05:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:05:15,906 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:05:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:05:16,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1935677998] [2019-11-20 00:05:16,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:05:16,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-20 00:05:16,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464814801] [2019-11-20 00:05:16,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 00:05:16,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:05:16,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 00:05:16,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:05:16,408 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 14 states. [2019-11-20 00:05:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:05:17,978 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-11-20 00:05:17,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 00:05:17,978 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2019-11-20 00:05:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:05:17,979 INFO L225 Difference]: With dead ends: 82 [2019-11-20 00:05:17,979 INFO L226 Difference]: Without dead ends: 82 [2019-11-20 00:05:17,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-11-20 00:05:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-20 00:05:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-11-20 00:05:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-20 00:05:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-11-20 00:05:17,990 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 51 [2019-11-20 00:05:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:05:17,991 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-11-20 00:05:17,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 00:05:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-11-20 00:05:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 00:05:17,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:05:17,992 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 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 00:05:18,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:05:18,196 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:05:18,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:05:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash 448050077, now seen corresponding path program 1 times [2019-11-20 00:05:18,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:05:18,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1135054095] [2019-11-20 00:05:18,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:05:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:05:18,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 00:05:18,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:05:18,607 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 00:05:18,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:18,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:18,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:18,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 00:05:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:05:18,655 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:05:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:05:18,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1135054095] [2019-11-20 00:05:18,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:05:18,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-20 00:05:18,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510846585] [2019-11-20 00:05:18,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:05:18,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:05:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:05:18,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:05:18,749 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 8 states. [2019-11-20 00:05:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:05:19,284 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-11-20 00:05:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 00:05:19,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-20 00:05:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:05:19,285 INFO L225 Difference]: With dead ends: 82 [2019-11-20 00:05:19,285 INFO L226 Difference]: Without dead ends: 82 [2019-11-20 00:05:19,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:05:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-20 00:05:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2019-11-20 00:05:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-20 00:05:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-11-20 00:05:19,287 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 51 [2019-11-20 00:05:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:05:19,288 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-11-20 00:05:19,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:05:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-11-20 00:05:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 00:05:19,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:05:19,289 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 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 00:05:19,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:05:19,493 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:05:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:05:19,494 INFO L82 PathProgramCache]: Analyzing trace with hash 448050115, now seen corresponding path program 1 times [2019-11-20 00:05:19,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:05:19,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [598029284] [2019-11-20 00:05:19,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:05:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:05:20,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 00:05:20,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:05:20,063 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 5 treesize of output 3 [2019-11-20 00:05:20,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:20,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-20 00:05:20,073 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 00:05:20,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:20,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:05:20,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:20,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-20 00:05:20,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,146 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-20 00:05:20,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-20 00:05:20,184 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 00:05:20,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:20,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-20 00:05:20,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:20,232 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 00:05:20,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:20,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-11-20 00:05:20,282 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:20,283 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 49 treesize of output 67 [2019-11-20 00:05:20,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:20,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:20,303 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 00:05:20,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:48 [2019-11-20 00:05:20,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:20,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 101 [2019-11-20 00:05:20,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:20,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:20,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:05:20,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:20,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:20,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:05:20,458 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 00:05:20,532 INFO L567 ElimStorePlain]: treesize reduction 42, result has 53.8 percent of original size [2019-11-20 00:05:20,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:20,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:20,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:49 [2019-11-20 00:05:20,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:20,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:20,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:20,680 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:20,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 131 [2019-11-20 00:05:20,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:20,710 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 51 treesize of output 53 [2019-11-20 00:05:20,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:20,915 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-20 00:05:20,915 INFO L567 ElimStorePlain]: treesize reduction 58, result has 64.8 percent of original size [2019-11-20 00:05:20,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-20 00:05:20,916 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:104 [2019-11-20 00:05:21,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:21,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:21,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:29,874 WARN L191 SmtUtils]: Spent 8.23 s on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 00:05:29,874 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:29,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 150 [2019-11-20 00:05:29,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:29,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:29,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:29,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2019-11-20 00:05:29,891 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:30,017 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-11-20 00:05:30,018 INFO L567 ElimStorePlain]: treesize reduction 90, result has 52.6 percent of original size [2019-11-20 00:05:30,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-20 00:05:30,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:130, output treesize:100 [2019-11-20 00:05:30,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:30,026 INFO L392 ElimStorePlain]: Different costs {4=[v_prenex_16], 7=[|#memory_$Pointer$.base|]} [2019-11-20 00:05:30,058 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:30,058 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 82 treesize of output 59 [2019-11-20 00:05:30,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:30,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:30,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:30,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 82 [2019-11-20 00:05:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:05:30,133 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:30,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:30,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 00:05:30,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:139, output treesize:37 [2019-11-20 00:05:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:05:30,349 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:05:30,533 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 00:05:30,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:30,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:30,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:16 [2019-11-20 00:05:31,842 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-20 00:05:32,106 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-20 00:05:32,406 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 00:05:32,784 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 00:05:33,265 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 00:05:33,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:33,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:33,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:82 [2019-11-20 00:05:33,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:33,496 INFO L567 ElimStorePlain]: treesize reduction 79, result has 25.5 percent of original size [2019-11-20 00:05:33,496 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 00:05:33,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:26 [2019-11-20 00:05:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:05:33,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [598029284] [2019-11-20 00:05:33,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:05:33,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2019-11-20 00:05:33,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984450167] [2019-11-20 00:05:33,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 00:05:33,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:05:33,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 00:05:33,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2019-11-20 00:05:33,608 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 26 states. [2019-11-20 00:05:37,487 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-20 00:05:38,982 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-11-20 00:05:39,589 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-11-20 00:05:40,146 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-11-20 00:05:40,597 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-20 00:05:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:05:41,091 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-11-20 00:05:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 00:05:41,091 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-11-20 00:05:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:05:41,092 INFO L225 Difference]: With dead ends: 93 [2019-11-20 00:05:41,093 INFO L226 Difference]: Without dead ends: 93 [2019-11-20 00:05:41,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=290, Invalid=1350, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 00:05:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-20 00:05:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2019-11-20 00:05:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-20 00:05:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2019-11-20 00:05:41,097 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 51 [2019-11-20 00:05:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:05:41,097 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2019-11-20 00:05:41,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 00:05:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2019-11-20 00:05:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 00:05:41,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:05:41,102 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 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 00:05:41,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:05:41,310 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr14REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr15REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr13REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr12REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION]=== [2019-11-20 00:05:41,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:05:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash 448050116, now seen corresponding path program 1 times [2019-11-20 00:05:41,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:05:41,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [837935286] [2019-11-20 00:05:41,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d9a665a2-a452-4e25-8509-8542a708bd0b/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 00:05:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:05:42,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-20 00:05:42,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:05:42,019 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 00:05:42,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,032 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 00:05:42,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,041 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-11-20 00:05:42,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,072 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 00:05:42,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,096 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 00:05:42,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,109 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-11-20 00:05:42,137 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 00:05:42,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,165 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 00:05:42,165 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-11-20 00:05:42,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 00:05:42,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 00:05:42,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:42 [2019-11-20 00:05:42,307 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 33 treesize of output 26 [2019-11-20 00:05:42,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,346 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 60 treesize of output 38 [2019-11-20 00:05:42,346 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:70 [2019-11-20 00:05:42,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,463 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:05:42,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,477 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 1 case distinctions, treesize of input 32 treesize of output 50 [2019-11-20 00:05:42,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,551 INFO L567 ElimStorePlain]: treesize reduction 16, result has 83.7 percent of original size [2019-11-20 00:05:42,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,557 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:05:42,572 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,572 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 55 treesize of output 64 [2019-11-20 00:05:42,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:42,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:42,574 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 00:05:42,650 INFO L567 ElimStorePlain]: treesize reduction 12, result has 85.5 percent of original size [2019-11-20 00:05:42,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:42,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:42,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:71 [2019-11-20 00:05:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:42,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:42,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,740 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 79 treesize of output 77 [2019-11-20 00:05:42,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 102 [2019-11-20 00:05:42,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:42,924 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 00:05:42,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:42,968 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:05:42,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:42,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 113 [2019-11-20 00:05:42,995 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:43,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:43,011 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 68 treesize of output 70 [2019-11-20 00:05:43,011 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:43,195 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-11-20 00:05:43,195 INFO L567 ElimStorePlain]: treesize reduction 44, result has 77.8 percent of original size [2019-11-20 00:05:43,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 00:05:43,196 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:177, output treesize:157 [2019-11-20 00:05:43,796 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 00:05:43,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:43,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:43,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:43,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:43,984 INFO L237 Elim1Store]: Index analysis took 150 ms [2019-11-20 00:05:44,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,010 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:05:44,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:44,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 130 treesize of output 131 [2019-11-20 00:05:44,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:44,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2019-11-20 00:05:44,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:44,630 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-20 00:05:44,630 INFO L567 ElimStorePlain]: treesize reduction 54, result has 79.0 percent of original size [2019-11-20 00:05:44,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:44,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 112 [2019-11-20 00:05:44,693 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:44,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2019-11-20 00:05:44,714 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:44,866 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 00:05:44,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:44,867 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 2 xjuncts. [2019-11-20 00:05:44,867 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:233, output treesize:173 [2019-11-20 00:05:44,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:44,874 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_18, v_prenex_17], 15=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-11-20 00:05:44,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:44,891 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:05:44,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2019-11-20 00:05:44,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:44,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:45,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:45,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:45,002 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:05:45,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2019-11-20 00:05:45,004 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:45,110 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 00:05:45,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:45,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:45,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:45,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:05:45,121 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:05:45,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:45,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 112 treesize of output 92 [2019-11-20 00:05:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:45,141 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 00:05:45,255 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-20 00:05:45,255 INFO L567 ElimStorePlain]: treesize reduction 12, result has 88.2 percent of original size [2019-11-20 00:05:45,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:45,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:05:45,262 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:05:45,266 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:45,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 39 [2019-11-20 00:05:45,266 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:45,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:45,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 00:05:45,302 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:197, output treesize:50 [2019-11-20 00:05:45,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:45,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:45,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:05:45,635 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:05:46,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:05:46,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:05:46,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:05:46,188 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 00:05:46,195 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:46,208 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:05:46,218 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:46,224 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:46,229 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:46,346 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 00:05:46,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:46,354 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:46,363 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:46,369 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:46,375 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:46,381 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:46,391 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:05:46,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:05:46,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-20 00:05:46,456 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:343, output treesize:199 [2019-11-20 00:05:53,718 WARN L191 SmtUtils]: Spent 6.75 s on a formula simplification that was a NOOP. DAG size: 113 [2019-11-20 00:05:55,364 WARN L191 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 00:05:57,236 WARN L191 SmtUtils]: Spent 1.87 s on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 00:05:59,240 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 00:06:00,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:06:00,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:06:00,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:06:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:06:00,911 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 00:06:00,930 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 00:06:01,003 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 00:06:01,087 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:01,156 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:06:01,180 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:02,437 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 94 [2019-11-20 00:06:02,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:02,460 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:06:02,480 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:06:02,537 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:06:02,556 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:06:02,577 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:06:02,606 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:06:06,243 WARN L191 SmtUtils]: Spent 3.64 s on a formula simplification that was a NOOP. DAG size: 152 [2019-11-20 00:06:06,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:06:06,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-20 00:06:06,245 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:823, output treesize:1143 [2019-11-20 00:06:09,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:06:09,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:06:09,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:06:09,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:06:09,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:09,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:09,805 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:09,847 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:11,278 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-11-20 00:06:11,279 INFO L567 ElimStorePlain]: treesize reduction 744, result has 56.1 percent of original size [2019-11-20 00:06:11,324 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:11,376 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:11,424 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:11,438 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:06:11,468 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:11,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:06:11,492 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-20 00:06:11,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:06:11,693 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.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 00:06:11,697 INFO L168 Benchmark]: Toolchain (without parser) took 141775.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 152.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:06:11,697 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:06:11,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:06:11,698 INFO L168 Benchmark]: Boogie Preprocessor took 75.51 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 00:06:11,698 INFO L168 Benchmark]: RCFGBuilder took 1088.43 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: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:06:11,700 INFO L168 Benchmark]: TraceAbstraction took 140026.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -66.6 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:06:11,701 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.51 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 1088.43 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: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 140026.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -66.6 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...