./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.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_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/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 dd9e7bf35989cde866740706d77fd71a632fd664 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 01:15:41,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:15:41,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:15:41,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:15:41,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:15:41,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:15:41,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:15:41,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:15:41,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:15:41,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:15:41,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:15:41,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:15:41,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:15:41,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:15:41,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:15:41,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:15:41,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:15:41,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:15:41,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:15:41,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:15:41,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:15:41,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:15:41,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:15:41,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:15:41,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:15:41,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:15:41,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:15:41,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:15:41,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:15:41,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:15:41,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:15:41,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:15:41,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:15:41,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:15:41,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:15:41,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:15:41,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:15:41,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:15:41,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:15:41,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:15:41,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:15:41,918 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 01:15:41,942 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:15:41,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:15:41,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:15:41,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:15:41,943 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:15:41,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:15:41,943 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:15:41,944 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 01:15:41,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:15:41,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:15:41,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:15:41,944 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 01:15:41,944 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 01:15:41,944 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 01:15:41,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:15:41,945 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:15:41,945 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:15:41,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:15:41,945 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:15:41,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:15:41,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:15:41,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:15:41,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:15:41,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:15:41,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:15:41,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:15:41,947 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:15:41,947 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:15:41,947 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:15:41,947 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_20eaec8c-e922-42cd-8914-475b99562284/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 -> dd9e7bf35989cde866740706d77fd71a632fd664 [2019-11-20 01:15:42,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:15:42,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:15:42,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:15:42,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:15:42,144 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:15:42,145 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2019-11-20 01:15:42,201 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/data/f450bda70/90c0194f9a6d43fcafe0e49c1b9244d1/FLAGcdda9f62d [2019-11-20 01:15:42,697 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:15:42,698 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2019-11-20 01:15:42,716 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/data/f450bda70/90c0194f9a6d43fcafe0e49c1b9244d1/FLAGcdda9f62d [2019-11-20 01:15:43,022 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/data/f450bda70/90c0194f9a6d43fcafe0e49c1b9244d1 [2019-11-20 01:15:43,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:15:43,026 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 01:15:43,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:15:43,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:15:43,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:15:43,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:15:43" (1/1) ... [2019-11-20 01:15:43,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718969dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43, skipping insertion in model container [2019-11-20 01:15:43,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:15:43" (1/1) ... [2019-11-20 01:15:43,046 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:15:43,088 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:15:43,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:15:43,494 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:15:43,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:15:43,584 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:15:43,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43 WrapperNode [2019-11-20 01:15:43,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:15:43,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:15:43,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:15:43,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:15:43,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43" (1/1) ... [2019-11-20 01:15:43,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43" (1/1) ... [2019-11-20 01:15:43,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43" (1/1) ... [2019-11-20 01:15:43,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43" (1/1) ... [2019-11-20 01:15:43,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43" (1/1) ... [2019-11-20 01:15:43,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43" (1/1) ... [2019-11-20 01:15:43,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43" (1/1) ... [2019-11-20 01:15:43,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:15:43,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:15:43,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:15:43,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:15:43,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:15:43,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 01:15:43,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:15:43,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 01:15:43,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 01:15:43,711 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-20 01:15:43,711 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-20 01:15:43,712 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-20 01:15:43,713 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-11-20 01:15:43,713 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2019-11-20 01:15:43,714 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2019-11-20 01:15:43,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 01:15:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 01:15:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 01:15:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 01:15:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 01:15:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 01:15:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 01:15:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 01:15:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 01:15:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 01:15:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 01:15:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 01:15:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 01:15:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 01:15:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 01:15:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 01:15:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 01:15:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 01:15:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 01:15:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 01:15:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 01:15:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 01:15:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 01:15:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 01:15:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 01:15:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 01:15:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 01:15:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 01:15:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 01:15:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 01:15:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 01:15:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 01:15:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 01:15:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 01:15:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 01:15:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 01:15:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 01:15:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 01:15:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 01:15:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 01:15:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 01:15:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 01:15:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 01:15:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 01:15:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 01:15:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 01:15:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 01:15:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 01:15:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 01:15:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 01:15:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 01:15:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 01:15:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 01:15:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 01:15:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 01:15:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 01:15:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 01:15:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 01:15:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 01:15:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 01:15:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 01:15:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 01:15:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 01:15:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 01:15:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 01:15:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 01:15:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 01:15:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 01:15:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 01:15:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 01:15:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 01:15:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 01:15:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 01:15:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 01:15:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 01:15:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 01:15:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 01:15:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 01:15:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 01:15:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 01:15:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 01:15:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 01:15:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 01:15:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 01:15:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 01:15:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 01:15:43,735 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 01:15:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 01:15:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 01:15:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 01:15:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 01:15:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 01:15:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 01:15:43,736 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 01:15:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 01:15:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 01:15:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 01:15:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 01:15:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 01:15:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 01:15:43,737 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 01:15:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 01:15:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 01:15:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 01:15:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 01:15:43,738 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 01:15:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 01:15:43,739 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-20 01:15:43,740 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-20 01:15:43,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 01:15:43,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 01:15:43,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 01:15:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-20 01:15:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-11-20 01:15:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 01:15:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:15:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2019-11-20 01:15:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 01:15:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2019-11-20 01:15:43,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 01:15:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 01:15:43,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:15:44,247 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-20 01:15:44,516 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:15:44,517 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-20 01:15:44,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:15:44 BoogieIcfgContainer [2019-11-20 01:15:44,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:15:44,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:15:44,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:15:44,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:15:44,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:15:43" (1/3) ... [2019-11-20 01:15:44,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247b07ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:15:44, skipping insertion in model container [2019-11-20 01:15:44,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:43" (2/3) ... [2019-11-20 01:15:44,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247b07ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:15:44, skipping insertion in model container [2019-11-20 01:15:44,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:15:44" (3/3) ... [2019-11-20 01:15:44,539 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2019-11-20 01:15:44,551 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:15:44,561 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-20 01:15:44,573 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-20 01:15:44,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:15:44,596 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 01:15:44,596 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:15:44,596 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:15:44,596 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:15:44,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:15:44,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:15:44,597 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:15:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-20 01:15:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 01:15:44,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:44,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:44,640 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1770400427, now seen corresponding path program 1 times [2019-11-20 01:15:44,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:44,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [768315089] [2019-11-20 01:15:44,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:44,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:15:44,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:44,966 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 01:15:44,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:44,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:44,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:44,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:15:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:44,990 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:45,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [768315089] [2019-11-20 01:15:45,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:45,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:15:45,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802095500] [2019-11-20 01:15:45,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:15:45,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:45,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:15:45,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:15:45,034 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-11-20 01:15:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:45,161 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-11-20 01:15:45,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:15:45,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 01:15:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:45,177 INFO L225 Difference]: With dead ends: 85 [2019-11-20 01:15:45,177 INFO L226 Difference]: Without dead ends: 78 [2019-11-20 01:15:45,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:15:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-20 01:15:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-20 01:15:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-20 01:15:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-20 01:15:45,237 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 13 [2019-11-20 01:15:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:45,238 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-20 01:15:45,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:15:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-20 01:15:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 01:15:45,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:45,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:45,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:45,453 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1770400428, now seen corresponding path program 1 times [2019-11-20 01:15:45,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:45,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1318773913] [2019-11-20 01:15:45,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:45,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:15:45,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:45,706 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 01:15:45,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:45,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:45,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:45,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 01:15:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:45,728 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:45,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1318773913] [2019-11-20 01:15:45,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:45,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 01:15:45,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618154473] [2019-11-20 01:15:45,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:15:45,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:45,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:15:45,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:15:45,792 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 4 states. [2019-11-20 01:15:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:46,003 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-11-20 01:15:46,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:15:46,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-20 01:15:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:46,007 INFO L225 Difference]: With dead ends: 76 [2019-11-20 01:15:46,007 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 01:15:46,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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 01:15:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 01:15:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-20 01:15:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 01:15:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-11-20 01:15:46,019 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 13 [2019-11-20 01:15:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:46,019 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-11-20 01:15:46,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:15:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-11-20 01:15:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 01:15:46,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:46,022 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 01:15:46,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:46,225 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:46,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1633216438, now seen corresponding path program 1 times [2019-11-20 01:15:46,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:46,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1981587749] [2019-11-20 01:15:46,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:46,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:15:46,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:46,498 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:46,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1981587749] [2019-11-20 01:15:46,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:46,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-20 01:15:46,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145751279] [2019-11-20 01:15:46,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:15:46,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:46,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:15:46,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:15:46,583 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 7 states. [2019-11-20 01:15:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:46,667 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2019-11-20 01:15:46,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:15:46,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-20 01:15:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:46,671 INFO L225 Difference]: With dead ends: 87 [2019-11-20 01:15:46,671 INFO L226 Difference]: Without dead ends: 84 [2019-11-20 01:15:46,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-20 01:15:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2019-11-20 01:15:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-20 01:15:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-11-20 01:15:46,687 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 18 [2019-11-20 01:15:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:46,687 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-11-20 01:15:46,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:15:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-11-20 01:15:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:15:46,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:46,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:46,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:46,892 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:46,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:46,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1350272738, now seen corresponding path program 1 times [2019-11-20 01:15:46,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:46,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [659685425] [2019-11-20 01:15:46,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:47,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:15:47,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:47,181 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 01:15:47,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:47,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:15:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:47,217 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:47,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [659685425] [2019-11-20 01:15:47,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:47,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 01:15:47,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887254667] [2019-11-20 01:15:47,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:15:47,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:15:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:15:47,278 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-11-20 01:15:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:47,551 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-20 01:15:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:15:47,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-20 01:15:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:47,555 INFO L225 Difference]: With dead ends: 77 [2019-11-20 01:15:47,555 INFO L226 Difference]: Without dead ends: 77 [2019-11-20 01:15:47,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:15:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-20 01:15:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-11-20 01:15:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 01:15:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-11-20 01:15:47,567 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2019-11-20 01:15:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:47,568 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-11-20 01:15:47,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:15:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-11-20 01:15:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:15:47,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:47,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:47,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:47,777 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:47,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:47,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1350272739, now seen corresponding path program 1 times [2019-11-20 01:15:47,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:47,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1550922280] [2019-11-20 01:15:47,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:48,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 01:15:48,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:48,017 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 01:15:48,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:48,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:48,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:48,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 01:15:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:48,088 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:48,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1550922280] [2019-11-20 01:15:48,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:48,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 01:15:48,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313309287] [2019-11-20 01:15:48,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:15:48,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:48,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:15:48,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:15:48,502 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 10 states. [2019-11-20 01:15:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:48,933 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-11-20 01:15:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:15:48,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 01:15:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:48,935 INFO L225 Difference]: With dead ends: 76 [2019-11-20 01:15:48,935 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 01:15:48,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:15:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 01:15:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-20 01:15:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 01:15:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-20 01:15:48,942 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 19 [2019-11-20 01:15:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:48,942 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-20 01:15:48,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:15:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-20 01:15:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 01:15:48,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:48,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:49,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:49,147 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:49,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash 318935620, now seen corresponding path program 1 times [2019-11-20 01:15:49,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:49,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [897866109] [2019-11-20 01:15:49,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:49,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:15:49,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:49,407 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:49,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [897866109] [2019-11-20 01:15:49,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:15:49,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-20 01:15:49,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108369051] [2019-11-20 01:15:49,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:15:49,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:15:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:15:49,588 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 9 states. [2019-11-20 01:15:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:49,761 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2019-11-20 01:15:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:15:49,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-20 01:15:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:49,763 INFO L225 Difference]: With dead ends: 89 [2019-11-20 01:15:49,763 INFO L226 Difference]: Without dead ends: 86 [2019-11-20 01:15:49,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:15:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-20 01:15:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2019-11-20 01:15:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-20 01:15:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-11-20 01:15:49,772 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 31 [2019-11-20 01:15:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:49,772 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-11-20 01:15:49,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:15:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-11-20 01:15:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 01:15:49,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:49,775 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:49,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:49,985 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash 829070986, now seen corresponding path program 2 times [2019-11-20 01:15:49,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:49,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [797873208] [2019-11-20 01:15:49,986 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:50,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 01:15:50,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:15:50,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:15:50,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:15:50,173 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:15:50,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [797873208] [2019-11-20 01:15:50,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:50,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 01:15:50,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677282238] [2019-11-20 01:15:50,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:15:50,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:50,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:15:50,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:15:50,254 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 10 states. [2019-11-20 01:15:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:50,389 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-20 01:15:50,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:15:50,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-20 01:15:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:50,390 INFO L225 Difference]: With dead ends: 104 [2019-11-20 01:15:50,390 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 01:15:50,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:15:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 01:15:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2019-11-20 01:15:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-20 01:15:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-20 01:15:50,399 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 44 [2019-11-20 01:15:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:50,400 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-20 01:15:50,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:15:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-20 01:15:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 01:15:50,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:50,402 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:50,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:50,609 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash 829071041, now seen corresponding path program 1 times [2019-11-20 01:15:50,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:50,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1298548422] [2019-11-20 01:15:50,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:50,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 01:15:50,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:50,885 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 01:15:50,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:50,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:50,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:50,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:15:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:15:51,033 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:15:51,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1298548422] [2019-11-20 01:15:51,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:51,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 11 [2019-11-20 01:15:51,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51388403] [2019-11-20 01:15:51,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:15:51,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:15:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:15:51,238 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 12 states. [2019-11-20 01:15:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:51,847 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2019-11-20 01:15:51,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 01:15:51,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-11-20 01:15:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:51,848 INFO L225 Difference]: With dead ends: 98 [2019-11-20 01:15:51,849 INFO L226 Difference]: Without dead ends: 98 [2019-11-20 01:15:51,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:15:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-20 01:15:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-20 01:15:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 01:15:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2019-11-20 01:15:51,855 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 44 [2019-11-20 01:15:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:51,856 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2019-11-20 01:15:51,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:15:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2019-11-20 01:15:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 01:15:51,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:51,858 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:52,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:52,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash 829071042, now seen corresponding path program 1 times [2019-11-20 01:15:52,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:52,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [926829938] [2019-11-20 01:15:52,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:52,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 01:15:52,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:52,382 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 01:15:52,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:52,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:52,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:52,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 01:15:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:15:52,625 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:15:53,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [926829938] [2019-11-20 01:15:53,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:53,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 21 [2019-11-20 01:15:53,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283461403] [2019-11-20 01:15:53,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:15:53,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:53,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:15:53,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:15:53,937 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand 22 states. [2019-11-20 01:15:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:56,366 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2019-11-20 01:15:56,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:15:56,367 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2019-11-20 01:15:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:56,369 INFO L225 Difference]: With dead ends: 100 [2019-11-20 01:15:56,369 INFO L226 Difference]: Without dead ends: 100 [2019-11-20 01:15:56,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-11-20 01:15:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-20 01:15:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-11-20 01:15:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 01:15:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-20 01:15:56,376 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 44 [2019-11-20 01:15:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:56,376 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-20 01:15:56,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:15:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-20 01:15:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:15:56,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:56,378 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:56,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:56,584 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:15:56,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:56,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1501553928, now seen corresponding path program 1 times [2019-11-20 01:15:56,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:56,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [309981674] [2019-11-20 01:15:56,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:56,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 01:15:56,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:56,887 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 01:15:56,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:56,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:56,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:56,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:15:57,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:57,033 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 01:15:57,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,063 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-20 01:15:57,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2019-11-20 01:15:57,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 01:15:57,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:57,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-20 01:15:57,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 01:15:57,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:57,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:57,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2019-11-20 01:15:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:57,549 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:58,180 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 01:15:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:58,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [309981674] [2019-11-20 01:15:58,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:15:58,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 28 [2019-11-20 01:15:58,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665894004] [2019-11-20 01:15:58,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 01:15:58,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 01:15:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-11-20 01:15:58,701 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 29 states. [2019-11-20 01:16:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:38,371 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2019-11-20 01:16:38,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-20 01:16:38,371 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2019-11-20 01:16:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:38,373 INFO L225 Difference]: With dead ends: 146 [2019-11-20 01:16:38,373 INFO L226 Difference]: Without dead ends: 146 [2019-11-20 01:16:38,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=254, Invalid=2098, Unknown=0, NotChecked=0, Total=2352 [2019-11-20 01:16:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-20 01:16:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2019-11-20 01:16:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 01:16:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2019-11-20 01:16:38,381 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 47 [2019-11-20 01:16:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:38,381 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2019-11-20 01:16:38,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 01:16:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2019-11-20 01:16:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:16:38,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:38,382 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:16:38,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:16:38,589 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:16:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1501553927, now seen corresponding path program 1 times [2019-11-20 01:16:38,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:16:38,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1839448065] [2019-11-20 01:16:38,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:16:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:38,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-20 01:16:38,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:38,952 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 01:16:38,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:38,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:38,969 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 01:16:38,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:38,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:38,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:16:38,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 01:16:39,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:16:39,164 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 01:16:39,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:39,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:39,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:39,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 01:16:39,190 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:39,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:39,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:16:39,202 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-11-20 01:16:39,283 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 01:16:39,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:39,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:39,307 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 01:16:39,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:39,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:39,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:16:39,323 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:43 [2019-11-20 01:16:39,761 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 25 treesize of output 13 [2019-11-20 01:16:39,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:39,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:39,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 01:16:39,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:39,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:39,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:16:39,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2019-11-20 01:16:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:39,936 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:16:41,323 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 01:16:42,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:16:47,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:16:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:47,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:47,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:47,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:53,958 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-20 01:16:53,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:58,928 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-20 01:17:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:17:05,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1839448065] [2019-11-20 01:17:05,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:17:05,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2019-11-20 01:17:05,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655631016] [2019-11-20 01:17:05,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-20 01:17:05,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:17:05,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-20 01:17:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1298, Unknown=4, NotChecked=0, Total=1406 [2019-11-20 01:17:05,764 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand 38 states. [2019-11-20 01:18:21,495 WARN L191 SmtUtils]: Spent 28.47 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-11-20 01:19:01,760 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-20 01:19:09,453 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-11-20 01:19:12,632 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-20 01:19:20,762 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-11-20 01:19:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:19:29,065 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2019-11-20 01:19:29,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 01:19:29,066 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 47 [2019-11-20 01:19:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:19:29,067 INFO L225 Difference]: With dead ends: 153 [2019-11-20 01:19:29,068 INFO L226 Difference]: Without dead ends: 153 [2019-11-20 01:19:29,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 110.7s TimeCoverageRelationStatistics Valid=254, Invalid=2589, Unknown=19, NotChecked=0, Total=2862 [2019-11-20 01:19:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-20 01:19:29,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 115. [2019-11-20 01:19:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-20 01:19:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2019-11-20 01:19:29,077 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 47 [2019-11-20 01:19:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:19:29,078 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2019-11-20 01:19:29,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-20 01:19:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2019-11-20 01:19:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 01:19:29,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:19:29,079 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:19:29,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:29,283 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:19:29,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:19:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash -707059766, now seen corresponding path program 2 times [2019-11-20 01:19:29,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:19:29,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [347083777] [2019-11-20 01:19:29,284 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:29,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:19:29,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:19:29,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:19:29,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:19:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:19:29,576 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:19:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:19:29,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [347083777] [2019-11-20 01:19:29,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:19:29,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 01:19:29,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380634811] [2019-11-20 01:19:29,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:19:29,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:19:29,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:19:29,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:19:29,698 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 12 states. [2019-11-20 01:19:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:19:30,076 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2019-11-20 01:19:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:19:30,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-20 01:19:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:19:30,078 INFO L225 Difference]: With dead ends: 136 [2019-11-20 01:19:30,078 INFO L226 Difference]: Without dead ends: 136 [2019-11-20 01:19:30,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-11-20 01:19:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-20 01:19:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2019-11-20 01:19:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 01:19:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2019-11-20 01:19:30,085 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 50 [2019-11-20 01:19:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:19:30,085 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2019-11-20 01:19:30,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:19:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2019-11-20 01:19:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 01:19:30,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:19:30,088 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:19:30,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:30,293 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:19:30,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:19:30,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1910665954, now seen corresponding path program 1 times [2019-11-20 01:19:30,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:19:30,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1907354505] [2019-11-20 01:19:30,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:19:30,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:19:30,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:19:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:19:30,638 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:19:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:19:30,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1907354505] [2019-11-20 01:19:30,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:19:30,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 01:19:30,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106052013] [2019-11-20 01:19:30,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:19:30,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:19:30,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:19:30,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:19:30,701 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 8 states. [2019-11-20 01:19:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:19:30,791 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2019-11-20 01:19:30,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:19:30,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-11-20 01:19:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:19:30,793 INFO L225 Difference]: With dead ends: 128 [2019-11-20 01:19:30,793 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 01:19:30,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:19:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 01:19:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2019-11-20 01:19:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-20 01:19:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2019-11-20 01:19:30,799 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 57 [2019-11-20 01:19:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:19:30,800 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2019-11-20 01:19:30,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:19:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2019-11-20 01:19:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:19:30,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:19:30,801 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:19:31,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:31,002 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:19:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:19:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash 343633398, now seen corresponding path program 1 times [2019-11-20 01:19:31,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:19:31,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1115679248] [2019-11-20 01:19:31,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:19:31,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:19:31,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:19:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:19:31,392 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:19:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:19:31,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1115679248] [2019-11-20 01:19:31,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:19:31,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 01:19:31,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324521579] [2019-11-20 01:19:31,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:19:31,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:19:31,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:19:31,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:19:31,510 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 12 states. [2019-11-20 01:19:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:19:31,671 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-11-20 01:19:31,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:19:31,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-11-20 01:19:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:19:31,672 INFO L225 Difference]: With dead ends: 98 [2019-11-20 01:19:31,672 INFO L226 Difference]: Without dead ends: 98 [2019-11-20 01:19:31,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:19:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-20 01:19:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2019-11-20 01:19:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-20 01:19:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-11-20 01:19:31,676 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 58 [2019-11-20 01:19:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:19:31,676 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-11-20 01:19:31,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:19:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-11-20 01:19:31,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 01:19:31,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:19:31,677 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:19:31,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:31,881 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:19:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:19:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash -173925578, now seen corresponding path program 2 times [2019-11-20 01:19:31,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:19:31,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [130838272] [2019-11-20 01:19:31,882 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:32,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 01:19:32,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:19:32,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:19:32,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:19:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:19:32,066 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:19:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:19:32,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [130838272] [2019-11-20 01:19:32,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:19:32,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 01:19:32,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172112740] [2019-11-20 01:19:32,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:19:32,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:19:32,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:19:32,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:19:32,152 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 10 states. [2019-11-20 01:19:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:19:32,248 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-11-20 01:19:32,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:19:32,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-11-20 01:19:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:19:32,249 INFO L225 Difference]: With dead ends: 109 [2019-11-20 01:19:32,249 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 01:19:32,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:19:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 01:19:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2019-11-20 01:19:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 01:19:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2019-11-20 01:19:32,254 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 65 [2019-11-20 01:19:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:19:32,254 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2019-11-20 01:19:32,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:19:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2019-11-20 01:19:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 01:19:32,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:19:32,255 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:19:32,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:32,456 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:19:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:19:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash -173925523, now seen corresponding path program 1 times [2019-11-20 01:19:32,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:19:32,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1354110806] [2019-11-20 01:19:32,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:19:32,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 01:19:32,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:19:32,751 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 01:19:32,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:32,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:32,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:19:32,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:19:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:19:32,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:19:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:19:33,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354110806] [2019-11-20 01:19:33,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:19:33,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 12 [2019-11-20 01:19:33,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184752324] [2019-11-20 01:19:33,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:19:33,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:19:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:19:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:19:33,111 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 13 states. [2019-11-20 01:19:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:19:33,703 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2019-11-20 01:19:33,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:19:33,704 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-11-20 01:19:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:19:33,705 INFO L225 Difference]: With dead ends: 117 [2019-11-20 01:19:33,705 INFO L226 Difference]: Without dead ends: 117 [2019-11-20 01:19:33,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:19:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-20 01:19:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2019-11-20 01:19:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-20 01:19:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2019-11-20 01:19:33,713 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 65 [2019-11-20 01:19:33,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:19:33,714 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2019-11-20 01:19:33,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:19:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2019-11-20 01:19:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 01:19:33,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:19:33,715 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:19:33,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:33,920 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:19:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:19:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash -173925522, now seen corresponding path program 1 times [2019-11-20 01:19:33,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:19:33,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [949771585] [2019-11-20 01:19:33,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:19:34,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 01:19:34,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:19:34,252 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 01:19:34,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:34,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:34,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:19:34,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 01:19:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:19:34,505 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:19:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:19:35,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [949771585] [2019-11-20 01:19:35,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:19:35,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-20 01:19:35,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591493913] [2019-11-20 01:19:35,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 01:19:35,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:19:35,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 01:19:35,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:19:35,835 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 23 states. [2019-11-20 01:19:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:19:37,542 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-11-20 01:19:37,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:19:37,544 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2019-11-20 01:19:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:19:37,545 INFO L225 Difference]: With dead ends: 111 [2019-11-20 01:19:37,545 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 01:19:37,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-11-20 01:19:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 01:19:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-11-20 01:19:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-20 01:19:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2019-11-20 01:19:37,549 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 65 [2019-11-20 01:19:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:19:37,550 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2019-11-20 01:19:37,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 01:19:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2019-11-20 01:19:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 01:19:37,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:19:37,551 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:19:37,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:37,755 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:19:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:19:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1684664130, now seen corresponding path program 1 times [2019-11-20 01:19:37,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:19:37,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1200478049] [2019-11-20 01:19:37,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:19:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:19:38,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-20 01:19:38,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:19:38,173 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 01:19:38,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:38,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:38,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:19:38,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:19:38,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:38,269 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 01:19:38,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:38,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:38,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:19:38,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-11-20 01:19:38,349 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 01:19:38,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:38,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:38,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:19:38,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-20 01:19:40,882 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-20 01:19:40,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:19:40,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:40,939 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 55 treesize of output 107 [2019-11-20 01:19:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:19:40,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:40,959 INFO L567 ElimStorePlain]: treesize reduction 87, result has 20.9 percent of original size [2019-11-20 01:19:40,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:19:40,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:23 [2019-11-20 01:19:41,011 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 20 treesize of output 12 [2019-11-20 01:19:41,012 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:19:41,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:41,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:19:41,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2019-11-20 01:19:41,211 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 35 treesize of output 19 [2019-11-20 01:19:41,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:41,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:41,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:19:41,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:28 [2019-11-20 01:19:41,371 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 27 treesize of output 15 [2019-11-20 01:19:41,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:41,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:41,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:19:41,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-11-20 01:19:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:19:41,464 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:19:41,755 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:19:41,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:41,758 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 01:19:41,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:14 [2019-11-20 01:19:41,902 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:19:41,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:41,912 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 01:19:41,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2019-11-20 01:19:44,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:44,202 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 28 treesize of output 32 [2019-11-20 01:19:44,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:19:44,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:44,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:44,222 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:19:44,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:44,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:19:44,228 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2019-11-20 01:19:44,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:44,841 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 18 treesize of output 22 [2019-11-20 01:19:44,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:19:44,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:44,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:44,865 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:19:44,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:19:44,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:19:44,878 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2019-11-20 01:19:47,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:19:47,738 INFO L567 ElimStorePlain]: treesize reduction 9, result has 60.9 percent of original size [2019-11-20 01:19:47,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:19:47,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2019-11-20 01:19:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:19:48,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1200478049] [2019-11-20 01:19:48,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:19:48,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 49 [2019-11-20 01:19:48,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813072263] [2019-11-20 01:19:48,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-11-20 01:19:48,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:19:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-11-20 01:19:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2303, Unknown=1, NotChecked=0, Total=2450 [2019-11-20 01:19:48,398 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 50 states. [2019-11-20 01:19:55,341 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 01:19:59,324 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 01:20:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:20:03,067 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2019-11-20 01:20:03,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-20 01:20:03,067 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 68 [2019-11-20 01:20:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:20:03,068 INFO L225 Difference]: With dead ends: 136 [2019-11-20 01:20:03,069 INFO L226 Difference]: Without dead ends: 136 [2019-11-20 01:20:03,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=457, Invalid=5548, Unknown=1, NotChecked=0, Total=6006 [2019-11-20 01:20:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-20 01:20:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2019-11-20 01:20:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-20 01:20:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2019-11-20 01:20:03,076 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 68 [2019-11-20 01:20:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:20:03,076 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2019-11-20 01:20:03,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-11-20 01:20:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2019-11-20 01:20:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 01:20:03,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:20:03,078 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:20:03,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:20:03,283 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:20:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:20:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1684664129, now seen corresponding path program 1 times [2019-11-20 01:20:03,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:20:03,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [928805574] [2019-11-20 01:20:03,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:20:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:20:03,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-20 01:20:03,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:20:03,751 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 01:20:03,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:03,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:03,764 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 01:20:03,764 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:03,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:03,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:20:03,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 01:20:03,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:20:03,925 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 01:20:03,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:03,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:03,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:03,950 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 01:20:03,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:03,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:03,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:20:03,970 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:21 [2019-11-20 01:20:04,083 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 01:20:04,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:04,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:04,117 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 01:20:04,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:04,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:04,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:20:04,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:43 [2019-11-20 01:20:04,565 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 20 treesize of output 12 [2019-11-20 01:20:04,566 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:04,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:04,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-20 01:20:04,589 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:04,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:04,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:04,599 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2019-11-20 01:20:25,549 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 01:20:25,554 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_BEFORE_CALL_3|], 6=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_88|]} [2019-11-20 01:20:25,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:20:25,561 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 41 treesize of output 11 [2019-11-20 01:20:25,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:25,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:25,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:20:25,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:25,621 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 67 [2019-11-20 01:20:25,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:20:25,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:25,677 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-11-20 01:20:25,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:25,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:51 [2019-11-20 01:20:25,746 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 7 treesize of output 3 [2019-11-20 01:20:25,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:25,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:25,760 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 20 treesize of output 12 [2019-11-20 01:20:25,761 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:25,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:25,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:25,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2019-11-20 01:20:27,990 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 23 treesize of output 11 [2019-11-20 01:20:27,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:28,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:28,036 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 35 treesize of output 19 [2019-11-20 01:20:28,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:28,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:28,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:28,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:49 [2019-11-20 01:20:32,329 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 25 treesize of output 13 [2019-11-20 01:20:32,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:32,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:32,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 01:20:32,356 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:32,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:32,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:32,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:18 [2019-11-20 01:20:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 15 refuted. 2 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 01:20:36,911 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:20:44,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:20:44,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:44,144 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:44,150 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:44,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:44,208 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 01:20:44,212 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 01:20:44,215 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 01:20:44,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:44,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 01:20:44,234 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:145, output treesize:61 [2019-11-20 01:20:46,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:20:46,965 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:46,978 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:46,987 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:47,221 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 01:20:47,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:47,239 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:47,248 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:47,257 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 01:20:47,434 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 01:20:47,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:47,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 01:20:47,435 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:289, output treesize:233 [2019-11-20 01:20:48,122 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 01:20:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:20:48,735 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:48,741 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:48,750 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:48,880 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 01:20:48,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:48,886 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:48,892 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:48,895 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 01:20:48,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:48,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-11-20 01:20:48,937 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:253, output treesize:146 [2019-11-20 01:20:51,968 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 01:20:53,067 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 01:20:53,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:20:53,128 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:53,199 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:53,216 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:20:53,986 WARN L191 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-20 01:20:53,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:54,017 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:54,035 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 01:20:54,054 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 01:20:54,551 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-20 01:20:54,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:20:54,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-11-20 01:20:54,552 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:589, output treesize:533 [2019-11-20 01:20:56,764 WARN L191 SmtUtils]: Spent 892.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 01:20:58,630 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 01:21:02,551 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-20 01:21:11,463 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-20 01:21:14,617 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 01:21:15,006 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 01:21:16,709 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 01:21:17,863 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 01:21:21,141 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 01:21:21,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:21:21,355 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 01:21:21,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:21:21,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:21:21,603 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 01:21:21,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:21:21,615 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:21:22,030 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-20 01:21:22,030 INFO L567 ElimStorePlain]: treesize reduction 58, result has 70.4 percent of original size [2019-11-20 01:21:22,039 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:21:22,246 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 01:21:22,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:21:22,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:21:22,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:22,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:22,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:21:22,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:22,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 7 xjuncts. [2019-11-20 01:21:22,251 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:186, output treesize:70 [2019-11-20 01:21:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 01:21:37,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:37,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 01:21:37,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:37,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:37,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:37,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:37,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 01:21:37,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:37,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:37,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:42,120 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-11-20 01:21:42,124 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-11-20 01:21:49,465 WARN L191 SmtUtils]: Spent 4.33 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 01:21:49,469 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-11-20 01:21:54,046 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 01:21:54,050 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-11-20 01:21:54,056 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-11-20 01:21:54,063 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-11-20 01:21:54,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:21:54,071 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-11-20 01:22:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:22:28,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [928805574] [2019-11-20 01:22:28,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:22:28,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 54 [2019-11-20 01:22:28,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141802041] [2019-11-20 01:22:28,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-20 01:22:28,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:22:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-20 01:22:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2775, Unknown=24, NotChecked=0, Total=2970 [2019-11-20 01:22:28,394 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 55 states. [2019-11-20 01:22:34,531 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2019-11-20 01:22:46,060 WARN L191 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2019-11-20 01:22:52,477 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-11-20 01:22:54,798 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-11-20 01:22:59,906 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 01:23:03,626 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 01:23:09,303 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-20 01:23:17,051 WARN L191 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2019-11-20 01:23:22,922 WARN L191 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-11-20 01:23:30,375 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-20 01:23:35,421 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-20 01:23:40,711 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-20 01:23:47,265 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-11-20 01:24:07,243 WARN L191 SmtUtils]: Spent 5.76 s on a formula simplification. DAG size of input: 115 DAG size of output: 91 [2019-11-20 01:24:26,390 WARN L191 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 160 DAG size of output: 111 [2019-11-20 01:24:34,619 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-20 01:24:35,536 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-11-20 01:24:38,223 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-11-20 01:24:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:24:49,341 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2019-11-20 01:24:49,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-20 01:24:49,344 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 68 [2019-11-20 01:24:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:24:49,345 INFO L225 Difference]: With dead ends: 141 [2019-11-20 01:24:49,345 INFO L226 Difference]: Without dead ends: 141 [2019-11-20 01:24:49,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 204.1s TimeCoverageRelationStatistics Valid=492, Invalid=5644, Unknown=26, NotChecked=0, Total=6162 [2019-11-20 01:24:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-20 01:24:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2019-11-20 01:24:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-20 01:24:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2019-11-20 01:24:49,352 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 68 [2019-11-20 01:24:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:24:49,353 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2019-11-20 01:24:49,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-20 01:24:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2019-11-20 01:24:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 01:24:49,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:24:49,354 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:24:49,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:49,554 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:24:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:24:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1134571978, now seen corresponding path program 2 times [2019-11-20 01:24:49,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:24:49,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [299085463] [2019-11-20 01:24:49,555 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:49,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:24:49,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:24:49,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:24:49,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:24:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:24:49,933 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:24:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:24:50,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [299085463] [2019-11-20 01:24:50,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:24:50,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 01:24:50,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983538322] [2019-11-20 01:24:50,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:24:50,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:24:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:24:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:24:50,079 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 12 states. [2019-11-20 01:24:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:24:50,493 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-11-20 01:24:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:24:50,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-11-20 01:24:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:24:50,495 INFO L225 Difference]: With dead ends: 125 [2019-11-20 01:24:50,496 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 01:24:50,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-11-20 01:24:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 01:24:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2019-11-20 01:24:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 01:24:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-11-20 01:24:50,501 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 71 [2019-11-20 01:24:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:24:50,502 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-11-20 01:24:50,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:24:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-11-20 01:24:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 01:24:50,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:24:50,503 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:24:50,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:50,717 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:24:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:24:50,717 INFO L82 PathProgramCache]: Analyzing trace with hash -93114241, now seen corresponding path program 1 times [2019-11-20 01:24:50,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:24:50,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [443045857] [2019-11-20 01:24:50,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:24:51,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 01:24:51,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:24:51,124 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 01:24:51,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:24:51,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:24:51,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:24:51,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:24:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:24:51,385 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:24:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:24:51,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [443045857] [2019-11-20 01:24:51,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:24:51,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 12 [2019-11-20 01:24:51,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596143274] [2019-11-20 01:24:51,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:24:51,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:24:51,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:24:51,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:24:51,602 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 13 states. [2019-11-20 01:24:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:24:52,354 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-11-20 01:24:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:24:52,354 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-11-20 01:24:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:24:52,356 INFO L225 Difference]: With dead ends: 131 [2019-11-20 01:24:52,356 INFO L226 Difference]: Without dead ends: 131 [2019-11-20 01:24:52,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 156 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:24:52,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-20 01:24:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2019-11-20 01:24:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-20 01:24:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-11-20 01:24:52,365 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 88 [2019-11-20 01:24:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:24:52,365 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-11-20 01:24:52,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:24:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-11-20 01:24:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 01:24:52,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:24:52,367 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:24:52,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:52,579 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:24:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:24:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash -93114240, now seen corresponding path program 1 times [2019-11-20 01:24:52,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:24:52,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [638292068] [2019-11-20 01:24:52,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:24:53,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 01:24:53,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:24:53,041 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 01:24:53,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:24:53,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:24:53,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:24:53,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 01:24:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:24:53,458 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:24:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:24:55,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [638292068] [2019-11-20 01:24:55,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:24:55,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-20 01:24:55,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786867785] [2019-11-20 01:24:55,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 01:24:55,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:24:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 01:24:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:24:55,097 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 23 states. [2019-11-20 01:24:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:24:57,516 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2019-11-20 01:24:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:24:57,520 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2019-11-20 01:24:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:24:57,521 INFO L225 Difference]: With dead ends: 126 [2019-11-20 01:24:57,521 INFO L226 Difference]: Without dead ends: 126 [2019-11-20 01:24:57,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 148 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-11-20 01:24:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-20 01:24:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2019-11-20 01:24:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 01:24:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2019-11-20 01:24:57,526 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 88 [2019-11-20 01:24:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:24:57,527 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2019-11-20 01:24:57,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 01:24:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2019-11-20 01:24:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 01:24:57,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:24:57,529 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:24:57,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:57,734 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:24:57,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:24:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash 581200194, now seen corresponding path program 1 times [2019-11-20 01:24:57,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:24:57,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1098940881] [2019-11-20 01:24:57,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:24:57,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:24:57,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:24:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:24:58,037 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:24:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:24:58,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1098940881] [2019-11-20 01:24:58,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:24:58,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 13 [2019-11-20 01:24:58,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535140932] [2019-11-20 01:24:58,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:24:58,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:24:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:24:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:24:58,218 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 13 states. [2019-11-20 01:24:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:24:58,682 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-11-20 01:24:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:24:58,683 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-11-20 01:24:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:24:58,684 INFO L225 Difference]: With dead ends: 125 [2019-11-20 01:24:58,684 INFO L226 Difference]: Without dead ends: 123 [2019-11-20 01:24:58,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:24:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-20 01:24:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2019-11-20 01:24:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 01:24:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2019-11-20 01:24:58,689 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 91 [2019-11-20 01:24:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:24:58,690 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2019-11-20 01:24:58,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:24:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2019-11-20 01:24:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 01:24:58,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:24:58,691 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:24:58,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:58,900 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:24:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:24:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash 582528586, now seen corresponding path program 1 times [2019-11-20 01:24:58,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:24:58,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1177569560] [2019-11-20 01:24:58,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:24:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:24:59,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 01:24:59,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:24:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:24:59,832 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:25:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:25:00,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1177569560] [2019-11-20 01:25:00,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:25:00,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-20 01:25:00,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284360467] [2019-11-20 01:25:00,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 01:25:00,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:25:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 01:25:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:25:00,340 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 23 states. [2019-11-20 01:25:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:01,663 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2019-11-20 01:25:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:25:01,663 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2019-11-20 01:25:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:01,665 INFO L225 Difference]: With dead ends: 121 [2019-11-20 01:25:01,665 INFO L226 Difference]: Without dead ends: 121 [2019-11-20 01:25:01,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-11-20 01:25:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-20 01:25:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-20 01:25:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-20 01:25:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2019-11-20 01:25:01,670 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 91 [2019-11-20 01:25:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:01,671 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2019-11-20 01:25:01,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 01:25:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2019-11-20 01:25:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 01:25:01,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:01,672 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:01,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:25:01,873 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 01:25:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1853663452, now seen corresponding path program 1 times [2019-11-20 01:25:01,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:25:01,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [674900230] [2019-11-20 01:25:01,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20eaec8c-e922-42cd-8914-475b99562284/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:25:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:02,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-20 01:25:02,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:02,421 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 01:25:02,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:02,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:02,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:02,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:25:02,516 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:02,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 01:25:02,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:02,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:02,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:02,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-20 01:25:02,580 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 01:25:02,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:02,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:02,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:02,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-20 01:25:05,120 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-20 01:25:05,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:25:05,196 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:05,196 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 55 treesize of output 107 [2019-11-20 01:25:05,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:25:05,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:05,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:05,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 01:25:05,246 INFO L567 ElimStorePlain]: treesize reduction 259, result has 9.8 percent of original size [2019-11-20 01:25:05,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:05,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:27 [2019-11-20 01:25:05,322 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 18 treesize of output 10 [2019-11-20 01:25:05,323 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:05,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:05,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:05,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2019-11-20 01:25:05,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:25:05,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 39 treesize of output 21 [2019-11-20 01:25:05,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:05,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:05,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:05,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-11-20 01:25:06,182 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 27 treesize of output 15 [2019-11-20 01:25:06,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:06,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:06,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:06,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2019-11-20 01:25:06,322 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 01:25:06,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:06,335 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-20 01:25:06,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:06,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-20 01:25:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:25:06,436 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:25:07,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:07,077 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:07,085 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:07,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:07,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 01:25:07,099 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:28 [2019-11-20 01:25:07,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:07,362 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:07,368 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:07,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:07,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 01:25:07,413 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:82 [2019-11-20 01:25:07,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:07,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:07,894 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 62 treesize of output 66 [2019-11-20 01:25:07,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:07,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:07,902 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 59 treesize of output 51 [2019-11-20 01:25:07,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:07,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:07,943 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:07,946 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 01:25:07,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:07,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-20 01:25:07,962 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:122, output treesize:66 [2019-11-20 01:25:08,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:08,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:25:08,658 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 01:25:08,661 INFO L168 Benchmark]: Toolchain (without parser) took 565635.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:25:08,662 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:25:08,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:25:08,662 INFO L168 Benchmark]: Boogie Preprocessor took 66.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:25:08,663 INFO L168 Benchmark]: RCFGBuilder took 866.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:25:08,663 INFO L168 Benchmark]: TraceAbstraction took 564140.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:25:08,664 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 866.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 564140.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...