./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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 0e11c684160c36739b32009d12dfc0b40146d3c7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (exists ((v_arrayElimCell_58 (_ BitVec 32))) (forall ((v_arrayElimCell_60 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse0 (bvadd |~#gl_list~0.offset| (_ bv4 32)))) (or (and (bvsle (bvadd |__list_add_#in~prev.offset| (_ bv4 32)) v_arrayElimCell_58) (not (bvsle .cse0 v_arrayElimCell_58))) (and (not (= v_arrayElimCell_59 v_arrayElimCell_60)) (= __list_add_~prev.base |~#gl_list~0.base|)) (not (= |__list_add_#in~prev.base| |~#gl_list~0.base|)) (not (bvsle (_ bv0 32) |~#gl_list~0.offset|)) (bvsle .cse0 v_arrayElimCell_59) (not (bvsle |~#gl_list~0.offset| .cse0)) (not (bvsle (bvadd __list_add_~prev.offset (_ bv4 32)) v_arrayElimCell_60)))))) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 22:58:32,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:58:32,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:58:32,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:58:32,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:58:32,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:58:32,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:58:32,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:58:32,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:58:32,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:58:32,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:58:32,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:58:32,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:58:32,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:58:32,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:58:32,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:58:32,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:58:32,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:58:32,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:58:32,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:58:32,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:58:32,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:58:32,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:58:32,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:58:32,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:58:32,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:58:32,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:58:32,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:58:32,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:58:32,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:58:32,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:58:32,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:58:32,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:58:32,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:58:32,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:58:32,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:58:32,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:58:32,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:58:32,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:58:32,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:58:32,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:58:32,881 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-19 22:58:32,904 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:58:32,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:58:32,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:58:32,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:58:32,916 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:58:32,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:58:32,917 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:58:32,917 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:58:32,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:58:32,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:58:32,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:58:32,917 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-19 22:58:32,917 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-19 22:58:32,918 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-19 22:58:32,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:58:32,918 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:58:32,918 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:58:32,918 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:58:32,918 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:58:32,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:58:32,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:58:32,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:58:32,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:58:32,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:58:32,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:58:32,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:58:32,919 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:58:32,919 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:58:32,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:58:32,919 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_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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 -> 0e11c684160c36739b32009d12dfc0b40146d3c7 [2019-11-19 22:58:33,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:58:33,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:58:33,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:58:33,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:58:33,076 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:58:33,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2019-11-19 22:58:33,134 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/data/f2641a904/ea8ce3e8c94f41a186458e96578685d5/FLAGceed43d4a [2019-11-19 22:58:33,661 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:58:33,662 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2019-11-19 22:58:33,695 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/data/f2641a904/ea8ce3e8c94f41a186458e96578685d5/FLAGceed43d4a [2019-11-19 22:58:34,144 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/bin/uautomizer/data/f2641a904/ea8ce3e8c94f41a186458e96578685d5 [2019-11-19 22:58:34,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:58:34,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-19 22:58:34,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:58:34,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:58:34,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:58:34,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:58:34" (1/1) ... [2019-11-19 22:58:34,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdd9545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34, skipping insertion in model container [2019-11-19 22:58:34,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:58:34" (1/1) ... [2019-11-19 22:58:34,167 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:58:34,238 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:58:34,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:58:34,735 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:58:34,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:58:34,891 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:58:34,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34 WrapperNode [2019-11-19 22:58:34,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:58:34,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:58:34,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:58:34,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:58:34,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34" (1/1) ... [2019-11-19 22:58:34,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34" (1/1) ... [2019-11-19 22:58:34,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34" (1/1) ... [2019-11-19 22:58:34,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34" (1/1) ... [2019-11-19 22:58:34,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34" (1/1) ... [2019-11-19 22:58:34,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34" (1/1) ... [2019-11-19 22:58:34,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34" (1/1) ... [2019-11-19 22:58:34,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:58:34,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:58:34,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:58:34,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:58:34,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 22:58:35,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-19 22:58:35,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:58:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-19 22:58:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-19 22:58:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-19 22:58:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2019-11-19 22:58:35,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-11-19 22:58:35,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2019-11-19 22:58:35,072 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2019-11-19 22:58:35,073 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2019-11-19 22:58:35,073 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2019-11-19 22:58:35,073 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2019-11-19 22:58:35,073 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2019-11-19 22:58:35,073 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2019-11-19 22:58:35,074 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2019-11-19 22:58:35,074 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2019-11-19 22:58:35,074 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-19 22:58:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-19 22:58:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-19 22:58:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-19 22:58:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-19 22:58:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-19 22:58:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-19 22:58:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-19 22:58:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-19 22:58:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-19 22:58:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-19 22:58:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-19 22:58:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-19 22:58:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-19 22:58:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-19 22:58:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-19 22:58:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-19 22:58:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-19 22:58:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-19 22:58:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-19 22:58:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-19 22:58:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-19 22:58:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-19 22:58:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-19 22:58:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-19 22:58:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-19 22:58:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-19 22:58:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-19 22:58:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-19 22:58:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-19 22:58:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-19 22:58:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-19 22:58:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-19 22:58:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-19 22:58:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-19 22:58:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-19 22:58:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-19 22:58:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-19 22:58:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-19 22:58:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-19 22:58:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-19 22:58:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-19 22:58:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-19 22:58:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-19 22:58:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-19 22:58:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-19 22:58:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-19 22:58:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-19 22:58:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-19 22:58:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-19 22:58:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-19 22:58:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-19 22:58:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-19 22:58:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-19 22:58:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-19 22:58:35,087 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-19 22:58:35,087 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-19 22:58:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-19 22:58:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-19 22:58:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-19 22:58:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-19 22:58:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-19 22:58:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-19 22:58:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-19 22:58:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-19 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-19 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-19 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-19 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-19 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-19 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-19 22:58:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-19 22:58:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-19 22:58:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-19 22:58:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-19 22:58:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-19 22:58:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-19 22:58:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-19 22:58:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-19 22:58:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-19 22:58:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-19 22:58:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-19 22:58:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-19 22:58:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-19 22:58:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-19 22:58:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-19 22:58:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-19 22:58:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-19 22:58:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-19 22:58:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-19 22:58:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-19 22:58:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-19 22:58:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-19 22:58:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-19 22:58:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-19 22:58:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-19 22:58:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-19 22:58:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-19 22:58:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-19 22:58:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-19 22:58:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-19 22:58:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-19 22:58:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-19 22:58:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-19 22:58:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2019-11-19 22:58:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2019-11-19 22:58:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2019-11-19 22:58:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2019-11-19 22:58:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2019-11-19 22:58:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2019-11-19 22:58:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2019-11-19 22:58:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2019-11-19 22:58:35,099 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2019-11-19 22:58:35,099 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2019-11-19 22:58:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2019-11-19 22:58:35,102 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2019-11-19 22:58:35,102 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2019-11-19 22:58:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2019-11-19 22:58:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2019-11-19 22:58:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2019-11-19 22:58:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2019-11-19 22:58:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2019-11-19 22:58:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2019-11-19 22:58:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2019-11-19 22:58:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2019-11-19 22:58:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2019-11-19 22:58:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2019-11-19 22:58:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2019-11-19 22:58:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2019-11-19 22:58:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2019-11-19 22:58:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-11-19 22:58:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2019-11-19 22:58:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2019-11-19 22:58:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2019-11-19 22:58:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2019-11-19 22:58:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2019-11-19 22:58:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2019-11-19 22:58:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2019-11-19 22:58:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2019-11-19 22:58:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2019-11-19 22:58:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2019-11-19 22:58:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2019-11-19 22:58:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-19 22:58:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-11-19 22:58:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2019-11-19 22:58:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2019-11-19 22:58:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2019-11-19 22:58:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-11-19 22:58:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2019-11-19 22:58:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2019-11-19 22:58:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2019-11-19 22:58:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2019-11-19 22:58:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2019-11-19 22:58:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2019-11-19 22:58:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2019-11-19 22:58:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2019-11-19 22:58:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2019-11-19 22:58:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2019-11-19 22:58:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2019-11-19 22:58:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2019-11-19 22:58:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2019-11-19 22:58:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2019-11-19 22:58:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2019-11-19 22:58:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2019-11-19 22:58:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2019-11-19 22:58:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2019-11-19 22:58:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2019-11-19 22:58:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2019-11-19 22:58:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2019-11-19 22:58:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2019-11-19 22:58:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2019-11-19 22:58:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2019-11-19 22:58:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2019-11-19 22:58:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2019-11-19 22:58:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2019-11-19 22:58:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2019-11-19 22:58:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2019-11-19 22:58:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-19 22:58:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2019-11-19 22:58:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2019-11-19 22:58:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2019-11-19 22:58:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2019-11-19 22:58:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2019-11-19 22:58:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2019-11-19 22:58:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2019-11-19 22:58:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2019-11-19 22:58:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2019-11-19 22:58:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2019-11-19 22:58:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2019-11-19 22:58:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2019-11-19 22:58:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2019-11-19 22:58:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2019-11-19 22:58:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2019-11-19 22:58:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2019-11-19 22:58:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2019-11-19 22:58:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2019-11-19 22:58:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2019-11-19 22:58:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2019-11-19 22:58:35,123 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2019-11-19 22:58:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2019-11-19 22:58:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2019-11-19 22:58:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2019-11-19 22:58:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2019-11-19 22:58:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2019-11-19 22:58:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2019-11-19 22:58:35,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-19 22:58:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-19 22:58:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2019-11-19 22:58:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 22:58:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-11-19 22:58:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 22:58:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2019-11-19 22:58:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2019-11-19 22:58:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2019-11-19 22:58:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2019-11-19 22:58:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 22:58:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 22:58:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2019-11-19 22:58:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2019-11-19 22:58:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:58:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2019-11-19 22:58:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 22:58:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2019-11-19 22:58:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2019-11-19 22:58:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-19 22:58:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-19 22:58:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:58:35,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-19 22:58:35,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:58:36,506 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:58:36,506 INFO L285 CfgBuilder]: Removed 41 assume(true) statements. [2019-11-19 22:58:36,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:58:36 BoogieIcfgContainer [2019-11-19 22:58:36,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:58:36,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:58:36,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:58:36,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:58:36,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:58:34" (1/3) ... [2019-11-19 22:58:36,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32decd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:58:36, skipping insertion in model container [2019-11-19 22:58:36,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:58:34" (2/3) ... [2019-11-19 22:58:36,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32decd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:58:36, skipping insertion in model container [2019-11-19 22:58:36,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:58:36" (3/3) ... [2019-11-19 22:58:36,518 INFO L109 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2019-11-19 22:58:36,535 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:58:36,543 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 70 error locations. [2019-11-19 22:58:36,553 INFO L249 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2019-11-19 22:58:36,573 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:58:36,573 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-19 22:58:36,573 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:58:36,573 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:58:36,574 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:58:36,574 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:58:36,574 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:58:36,574 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:58:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2019-11-19 22:58:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:58:36,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:58:36,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:58:36,616 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 22:58:36,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:58:36,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1273393573, now seen corresponding path program 1 times [2019-11-19 22:58:36,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:58:36,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [534891389] [2019-11-19 22:58:36,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 22:58:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:58:36,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 22:58:36,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:58:37,004 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-19 22:58:37,005 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:58:37,027 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-19 22:58:37,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [534891389] [2019-11-19 22:58:37,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:58:37,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:58:37,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016368572] [2019-11-19 22:58:37,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 22:58:37,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:58:37,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:58:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:58:37,051 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 2 states. [2019-11-19 22:58:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:58:37,109 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2019-11-19 22:58:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:58:37,110 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-19 22:58:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:58:37,127 INFO L225 Difference]: With dead ends: 235 [2019-11-19 22:58:37,127 INFO L226 Difference]: Without dead ends: 216 [2019-11-19 22:58:37,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:58:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-19 22:58:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-19 22:58:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-19 22:58:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 224 transitions. [2019-11-19 22:58:37,203 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 224 transitions. Word has length 10 [2019-11-19 22:58:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:58:37,203 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 224 transitions. [2019-11-19 22:58:37,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 22:58:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 224 transitions. [2019-11-19 22:58:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:58:37,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:58:37,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:58:37,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:58:37,409 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 22:58:37,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:58:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1273393635, now seen corresponding path program 1 times [2019-11-19 22:58:37,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:58:37,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [591078307] [2019-11-19 22:58:37,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 22:58:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:58:37,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:58:37,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:58:37,782 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-19 22:58:37,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:37,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:37,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:58:37,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:58:37,793 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-19 22:58:37,793 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:58:37,800 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-19 22:58:37,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [591078307] [2019-11-19 22:58:37,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:58:37,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:58:37,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040010535] [2019-11-19 22:58:37,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:58:37,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:58:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:58:37,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:58:37,803 INFO L87 Difference]: Start difference. First operand 216 states and 224 transitions. Second operand 3 states. [2019-11-19 22:58:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:58:38,080 INFO L93 Difference]: Finished difference Result 213 states and 221 transitions. [2019-11-19 22:58:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:58:38,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-19 22:58:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:58:38,083 INFO L225 Difference]: With dead ends: 213 [2019-11-19 22:58:38,083 INFO L226 Difference]: Without dead ends: 213 [2019-11-19 22:58:38,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:58:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-19 22:58:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-11-19 22:58:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-19 22:58:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 221 transitions. [2019-11-19 22:58:38,095 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 221 transitions. Word has length 10 [2019-11-19 22:58:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:58:38,096 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 221 transitions. [2019-11-19 22:58:38,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:58:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 221 transitions. [2019-11-19 22:58:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:58:38,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:58:38,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:58:38,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:58:38,302 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 22:58:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:58:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1273393636, now seen corresponding path program 1 times [2019-11-19 22:58:38,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:58:38,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1620377273] [2019-11-19 22:58:38,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 22:58:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:58:38,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:58:38,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:58:38,600 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-19 22:58:38,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:38,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:38,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:58:38,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:58:38,618 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-19 22:58:38,619 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:58:38,657 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-19 22:58:38,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1620377273] [2019-11-19 22:58:38,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:58:38,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-19 22:58:38,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182746944] [2019-11-19 22:58:38,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:58:38,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:58:38,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:58:38,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:58:38,658 INFO L87 Difference]: Start difference. First operand 213 states and 221 transitions. Second operand 4 states. [2019-11-19 22:58:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:58:39,249 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-11-19 22:58:39,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:58:39,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-19 22:58:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:58:39,251 INFO L225 Difference]: With dead ends: 210 [2019-11-19 22:58:39,251 INFO L226 Difference]: Without dead ends: 210 [2019-11-19 22:58:39,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:58:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-19 22:58:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-11-19 22:58:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-19 22:58:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 218 transitions. [2019-11-19 22:58:39,264 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 218 transitions. Word has length 10 [2019-11-19 22:58:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:58:39,264 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 218 transitions. [2019-11-19 22:58:39,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:58:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 218 transitions. [2019-11-19 22:58:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:58:39,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:58:39,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:58:39,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:58:39,468 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 22:58:39,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:58:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1775856405, now seen corresponding path program 1 times [2019-11-19 22:58:39,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:58:39,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1135489136] [2019-11-19 22:58:39,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 22:58:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:58:39,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 22:58:39,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:58:39,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:39,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-19 22:58:39,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:39,800 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-11-19 22:58:39,801 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-19 22:58:39,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:24 [2019-11-19 22:58:39,862 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 14 [2019-11-19 22:58:39,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:39,867 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 22 treesize of output 16 [2019-11-19 22:58:39,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:39,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:39,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:58:39,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-11-19 22:58:39,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:58:39,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:39,979 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 17 treesize of output 33 [2019-11-19 22:58:39,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:40,043 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:40,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 60 [2019-11-19 22:58:40,045 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:40,115 INFO L567 ElimStorePlain]: treesize reduction 42, result has 45.5 percent of original size [2019-11-19 22:58:40,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:58:40,116 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2019-11-19 22:58:40,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:58:40,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:58:40,210 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-19 22:58:40,210 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:58:40,339 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-19 22:58:40,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1135489136] [2019-11-19 22:58:40,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:58:40,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 8 [2019-11-19 22:58:40,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421381824] [2019-11-19 22:58:40,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:58:40,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:58:40,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:58:40,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:58:40,341 INFO L87 Difference]: Start difference. First operand 210 states and 218 transitions. Second operand 9 states. [2019-11-19 22:58:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:58:46,510 INFO L93 Difference]: Finished difference Result 240 states and 249 transitions. [2019-11-19 22:58:46,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:58:46,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-11-19 22:58:46,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:58:46,514 INFO L225 Difference]: With dead ends: 240 [2019-11-19 22:58:46,514 INFO L226 Difference]: Without dead ends: 240 [2019-11-19 22:58:46,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:58:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-19 22:58:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 215. [2019-11-19 22:58:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-19 22:58:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 225 transitions. [2019-11-19 22:58:46,532 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 225 transitions. Word has length 13 [2019-11-19 22:58:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:58:46,533 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 225 transitions. [2019-11-19 22:58:46,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:58:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 225 transitions. [2019-11-19 22:58:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:58:46,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:58:46,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:58:46,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:58:46,742 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 22:58:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:58:46,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1775856404, now seen corresponding path program 1 times [2019-11-19 22:58:46,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:58:46,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1545110400] [2019-11-19 22:58:46,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 22:58:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:58:47,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-19 22:58:47,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:58:47,016 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-19 22:58:47,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:47,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:47,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:47,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-19 22:58:47,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:47,085 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2019-11-19 22:58:47,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:58:47,085 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:32 [2019-11-19 22:58:47,120 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 30 treesize of output 24 [2019-11-19 22:58:47,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:47,125 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 32 treesize of output 26 [2019-11-19 22:58:47,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:47,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:47,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:58:47,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:45 [2019-11-19 22:58:47,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:58:47,210 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_98|], 3=[|v_#valid_110|]} [2019-11-19 22:58:47,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:47,223 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 32 treesize of output 34 [2019-11-19 22:58:47,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:47,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:47,233 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 34 treesize of output 36 [2019-11-19 22:58:47,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:47,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:47,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:47,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-11-19 22:58:47,291 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:47,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:47,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:47,308 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:47,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2019-11-19 22:58:47,310 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:47,334 INFO L567 ElimStorePlain]: treesize reduction 20, result has 44.4 percent of original size [2019-11-19 22:58:47,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:58:47,335 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:16 [2019-11-19 22:58:47,396 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-19 22:58:47,397 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:58:47,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:58:48,117 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-19 22:58:48,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1545110400] [2019-11-19 22:58:48,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:58:48,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-19 22:58:48,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934162132] [2019-11-19 22:58:48,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:58:48,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:58:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:58:48,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:58:48,119 INFO L87 Difference]: Start difference. First operand 215 states and 225 transitions. Second operand 11 states. [2019-11-19 22:58:50,426 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-11-19 22:58:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:58:50,786 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-11-19 22:58:50,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:58:50,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-11-19 22:58:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:58:50,788 INFO L225 Difference]: With dead ends: 234 [2019-11-19 22:58:50,788 INFO L226 Difference]: Without dead ends: 234 [2019-11-19 22:58:50,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:58:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-19 22:58:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 212. [2019-11-19 22:58:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-19 22:58:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 220 transitions. [2019-11-19 22:58:50,796 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 220 transitions. Word has length 13 [2019-11-19 22:58:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:58:50,796 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 220 transitions. [2019-11-19 22:58:50,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:58:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 220 transitions. [2019-11-19 22:58:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:58:50,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:58:50,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:58:51,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:58:51,008 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 22:58:51,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:58:51,008 INFO L82 PathProgramCache]: Analyzing trace with hash 869532763, now seen corresponding path program 1 times [2019-11-19 22:58:51,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:58:51,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1516010824] [2019-11-19 22:58:51,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 22:58:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:58:51,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-19 22:58:51,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:58:51,314 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:51,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-19 22:58:51,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:51,347 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.4 percent of original size [2019-11-19 22:58:51,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:58:51,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:41 [2019-11-19 22:58:51,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 37 treesize of output 33 [2019-11-19 22:58:51,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:51,378 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 39 treesize of output 35 [2019-11-19 22:58:51,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:51,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:51,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:58:51,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2019-11-19 22:58:51,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:58:51,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:51,494 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 35 treesize of output 39 [2019-11-19 22:58:51,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:51,514 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:51,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2019-11-19 22:58:51,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:51,553 INFO L567 ElimStorePlain]: treesize reduction 32, result has 42.9 percent of original size [2019-11-19 22:58:51,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:58:51,553 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:24 [2019-11-19 22:58:51,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:51,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-19 22:58:51,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:51,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:51,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:58:51,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2019-11-19 22:58:51,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:58:51,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:51,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:51,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:58:51,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-19 22:58:51,826 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-19 22:58:51,826 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:58:52,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:52,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 48 [2019-11-19 22:58:52,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:58:52,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:58:52,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:52,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:52,050 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-19 22:58:52,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:52,066 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-19 22:58:52,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2019-11-19 22:58:55,495 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-19 22:58:55,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1516010824] [2019-11-19 22:58:55,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:58:55,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 18 [2019-11-19 22:58:55,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860691963] [2019-11-19 22:58:55,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 22:58:55,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:58:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 22:58:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=293, Unknown=1, NotChecked=0, Total=342 [2019-11-19 22:58:55,497 INFO L87 Difference]: Start difference. First operand 212 states and 220 transitions. Second operand 19 states. [2019-11-19 22:58:56,274 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-19 22:58:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:58:58,958 INFO L93 Difference]: Finished difference Result 235 states and 245 transitions. [2019-11-19 22:58:58,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 22:58:58,959 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2019-11-19 22:58:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:58:58,960 INFO L225 Difference]: With dead ends: 235 [2019-11-19 22:58:58,960 INFO L226 Difference]: Without dead ends: 235 [2019-11-19 22:58:58,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=121, Invalid=528, Unknown=1, NotChecked=0, Total=650 [2019-11-19 22:58:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-19 22:58:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-11-19 22:58:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-19 22:58:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 244 transitions. [2019-11-19 22:58:58,970 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 244 transitions. Word has length 16 [2019-11-19 22:58:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:58:58,970 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 244 transitions. [2019-11-19 22:58:58,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 22:58:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 244 transitions. [2019-11-19 22:58:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:58:58,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:58:58,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:58:59,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:58:59,175 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 22:58:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:58:59,175 INFO L82 PathProgramCache]: Analyzing trace with hash 869532764, now seen corresponding path program 1 times [2019-11-19 22:58:59,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:58:59,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1365580075] [2019-11-19 22:58:59,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 22:58:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:58:59,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-19 22:58:59,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:58:59,469 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:59,469 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-19 22:58:59,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,507 INFO L567 ElimStorePlain]: treesize reduction 10, result has 82.5 percent of original size [2019-11-19 22:58:59,512 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-19 22:58:59,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:59,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,530 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:46 [2019-11-19 22:58:59,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:58:59,577 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_114|], 3=[|v_#valid_130|]} [2019-11-19 22:58:59,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:59,592 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 55 treesize of output 57 [2019-11-19 22:58:59,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:59,602 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 57 treesize of output 59 [2019-11-19 22:58:59,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:59,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:59,681 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:59,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 66 [2019-11-19 22:58:59,682 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:59,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-11-19 22:58:59,690 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,735 INFO L567 ElimStorePlain]: treesize reduction 47, result has 45.3 percent of original size [2019-11-19 22:58:59,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,735 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:39 [2019-11-19 22:58:59,757 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_71|], 6=[|v_#memory_$Pointer$.base_76|]} [2019-11-19 22:58:59,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:59,764 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-19 22:58:59,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:59,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:59,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:58:59,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-19 22:58:59,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:59,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:58:59,826 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:39 [2019-11-19 22:58:59,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:58:59,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:59,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:58:59,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:58:59,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:58:59,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:58:59,955 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:16 [2019-11-19 22:59:00,032 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-19 22:59:00,032 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:59:00,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:59:00,546 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-19 22:59:00,555 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-19 22:59:00,583 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-19 22:59:00,707 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-19 22:59:00,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:59:00,720 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:59:00,729 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 22:59:00,733 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-19 22:59:00,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:59:00,777 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-19 22:59:00,778 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:139, output treesize:80 [2019-11-19 22:59:01,369 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-19 22:59:01,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:59:05,727 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-19 22:59:47,505 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-19 22:59:47,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1365580075] [2019-11-19 22:59:47,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:59:47,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-19 22:59:47,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619506278] [2019-11-19 22:59:47,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 22:59:47,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:59:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 22:59:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=260, Unknown=1, NotChecked=0, Total=306 [2019-11-19 22:59:47,507 INFO L87 Difference]: Start difference. First operand 227 states and 244 transitions. Second operand 18 states. [2019-11-19 22:59:57,908 WARN L191 SmtUtils]: Spent 9.10 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-11-19 23:00:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:04,301 INFO L93 Difference]: Finished difference Result 234 states and 244 transitions. [2019-11-19 23:00:04,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 23:00:04,302 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2019-11-19 23:00:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:00:04,304 INFO L225 Difference]: With dead ends: 234 [2019-11-19 23:00:04,304 INFO L226 Difference]: Without dead ends: 234 [2019-11-19 23:00:04,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 57.4s TimeCoverageRelationStatistics Valid=132, Invalid=569, Unknown=1, NotChecked=0, Total=702 [2019-11-19 23:00:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-19 23:00:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2019-11-19 23:00:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-19 23:00:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 243 transitions. [2019-11-19 23:00:04,314 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 243 transitions. Word has length 16 [2019-11-19 23:00:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:00:04,314 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 243 transitions. [2019-11-19 23:00:04,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 23:00:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 243 transitions. [2019-11-19 23:00:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 23:00:04,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:00:04,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:04,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:00:04,516 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 23:00:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1185712331, now seen corresponding path program 1 times [2019-11-19 23:00:04,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:00:04,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [830680198] [2019-11-19 23:00:04,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 23:00:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:04,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:00:04,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:04,762 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-19 23:00:04,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:00:04,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:04,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:00:04,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 23:00:04,791 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-19 23:00:04,791 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:00:04,810 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-19 23:00:04,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [830680198] [2019-11-19 23:00:04,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:00:04,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-19 23:00:04,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968015746] [2019-11-19 23:00:04,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:00:04,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:00:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:00:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:00:04,812 INFO L87 Difference]: Start difference. First operand 227 states and 243 transitions. Second operand 7 states. [2019-11-19 23:00:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:05,484 INFO L93 Difference]: Finished difference Result 239 states and 252 transitions. [2019-11-19 23:00:05,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:00:05,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-19 23:00:05,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:00:05,486 INFO L225 Difference]: With dead ends: 239 [2019-11-19 23:00:05,486 INFO L226 Difference]: Without dead ends: 239 [2019-11-19 23:00:05,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:00:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-19 23:00:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2019-11-19 23:00:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-19 23:00:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 252 transitions. [2019-11-19 23:00:05,495 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 252 transitions. Word has length 17 [2019-11-19 23:00:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:00:05,496 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 252 transitions. [2019-11-19 23:00:05,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:00:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 252 transitions. [2019-11-19 23:00:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 23:00:05,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:00:05,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:05,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:00:05,701 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 23:00:05,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:05,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1185712332, now seen corresponding path program 1 times [2019-11-19 23:00:05,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:00:05,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [678280121] [2019-11-19 23:00:05,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 23:00:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:05,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 23:00:05,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:05,973 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-19 23:00:05,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:00:05,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:05,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:00:05,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 23:00:06,034 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-19 23:00:06,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:00:06,299 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-19 23:00:06,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [678280121] [2019-11-19 23:00:06,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:00:06,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-19 23:00:06,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858748411] [2019-11-19 23:00:06,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 23:00:06,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:00:06,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 23:00:06,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:00:06,300 INFO L87 Difference]: Start difference. First operand 233 states and 252 transitions. Second operand 12 states. [2019-11-19 23:00:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:08,246 INFO L93 Difference]: Finished difference Result 237 states and 248 transitions. [2019-11-19 23:00:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:00:08,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-11-19 23:00:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:00:08,249 INFO L225 Difference]: With dead ends: 237 [2019-11-19 23:00:08,249 INFO L226 Difference]: Without dead ends: 237 [2019-11-19 23:00:08,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:00:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-19 23:00:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2019-11-19 23:00:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-19 23:00:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 248 transitions. [2019-11-19 23:00:08,258 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 248 transitions. Word has length 17 [2019-11-19 23:00:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:00:08,269 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 248 transitions. [2019-11-19 23:00:08,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 23:00:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 248 transitions. [2019-11-19 23:00:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 23:00:08,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:00:08,271 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-19 23:00:08,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:00:08,474 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 23:00:08,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:08,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1303231278, now seen corresponding path program 1 times [2019-11-19 23:00:08,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:00:08,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [184926141] [2019-11-19 23:00:08,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 23:00:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:08,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:00:08,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:08,775 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 9 treesize of output 3 [2019-11-19 23:00:08,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:00:08,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:08,778 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-19 23:00:08,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2019-11-19 23:00:08,818 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-19 23:00:08,818 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:00:08,846 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-19 23:00:08,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [184926141] [2019-11-19 23:00:08,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:00:08,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 6 [2019-11-19 23:00:08,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69820165] [2019-11-19 23:00:08,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:00:08,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:00:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:00:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:00:08,848 INFO L87 Difference]: Start difference. First operand 233 states and 248 transitions. Second operand 7 states. [2019-11-19 23:00:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:11,713 INFO L93 Difference]: Finished difference Result 232 states and 245 transitions. [2019-11-19 23:00:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 23:00:11,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-19 23:00:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:00:11,718 INFO L225 Difference]: With dead ends: 232 [2019-11-19 23:00:11,718 INFO L226 Difference]: Without dead ends: 232 [2019-11-19 23:00:11,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:00:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-19 23:00:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-11-19 23:00:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 23:00:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 245 transitions. [2019-11-19 23:00:11,727 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 245 transitions. Word has length 19 [2019-11-19 23:00:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:00:11,727 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 245 transitions. [2019-11-19 23:00:11,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:00:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 245 transitions. [2019-11-19 23:00:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 23:00:11,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:00:11,728 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-19 23:00:11,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:00:11,932 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 23:00:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:11,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1303231279, now seen corresponding path program 1 times [2019-11-19 23:00:11,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:00:11,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [332099774] [2019-11-19 23:00:11,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 23:00:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:12,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:00:12,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:12,261 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 9 treesize of output 3 [2019-11-19 23:00:12,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:00:12,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:12,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:00:12,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:3 [2019-11-19 23:00:12,337 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-19 23:00:12,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:00:12,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:00:12,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-19 23:00:12,489 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-19 23:00:12,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-19 23:00:12,496 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-19 23:00:12,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:12,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 23:00:12,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-19 23:00:12,764 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-19 23:00:12,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [332099774] [2019-11-19 23:00:12,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:00:12,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-11-19 23:00:12,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776538742] [2019-11-19 23:00:12,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 23:00:12,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:00:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 23:00:12,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-19 23:00:12,766 INFO L87 Difference]: Start difference. First operand 232 states and 245 transitions. Second operand 15 states. [2019-11-19 23:00:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:14,742 INFO L93 Difference]: Finished difference Result 233 states and 242 transitions. [2019-11-19 23:00:14,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:00:14,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-11-19 23:00:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:00:14,744 INFO L225 Difference]: With dead ends: 233 [2019-11-19 23:00:14,744 INFO L226 Difference]: Without dead ends: 233 [2019-11-19 23:00:14,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-11-19 23:00:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-19 23:00:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2019-11-19 23:00:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-19 23:00:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 242 transitions. [2019-11-19 23:00:14,754 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 242 transitions. Word has length 19 [2019-11-19 23:00:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:00:14,754 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 242 transitions. [2019-11-19 23:00:14,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 23:00:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 242 transitions. [2019-11-19 23:00:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 23:00:14,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:00:14,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:14,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:00:14,960 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 23:00:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1864801537, now seen corresponding path program 1 times [2019-11-19 23:00:14,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:00:14,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [682650808] [2019-11-19 23:00:14,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 23:00:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:15,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:00:15,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:15,261 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 9 treesize of output 3 [2019-11-19 23:00:15,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:00:15,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:15,262 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-19 23:00:15,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2019-11-19 23:00:15,340 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-19 23:00:15,340 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:00:15,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:15,417 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 20 treesize of output 22 [2019-11-19 23:00:15,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:00:15,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:15,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:00:15,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-19 23:00:15,468 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:15,469 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 20 treesize of output 22 [2019-11-19 23:00:15,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:00:15,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:15,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:00:15,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-19 23:00:15,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:15,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-19 23:00:15,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:15,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:15,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:00:15,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:15,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:00:15,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:8 [2019-11-19 23:00:15,626 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-19 23:00:15,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [682650808] [2019-11-19 23:00:15,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:00:15,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2019-11-19 23:00:15,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774834138] [2019-11-19 23:00:15,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 23:00:15,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:00:15,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 23:00:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:00:15,628 INFO L87 Difference]: Start difference. First operand 231 states and 242 transitions. Second operand 12 states. [2019-11-19 23:00:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:00:25,511 INFO L93 Difference]: Finished difference Result 226 states and 237 transitions. [2019-11-19 23:00:25,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:00:25,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-19 23:00:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:00:25,513 INFO L225 Difference]: With dead ends: 226 [2019-11-19 23:00:25,513 INFO L226 Difference]: Without dead ends: 226 [2019-11-19 23:00:25,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-11-19 23:00:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-19 23:00:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-11-19 23:00:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-19 23:00:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 237 transitions. [2019-11-19 23:00:25,521 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 237 transitions. Word has length 38 [2019-11-19 23:00:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:00:25,521 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 237 transitions. [2019-11-19 23:00:25,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 23:00:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 237 transitions. [2019-11-19 23:00:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 23:00:25,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:00:25,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:00:25,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:00:25,727 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__list_addErr2REQUIRES_VIOLATION, __list_addErr3REQUIRES_VIOLATION, __list_addErr4REQUIRES_VIOLATION, __list_addErr5REQUIRES_VIOLATION, __list_addErr0REQUIRES_VIOLATION, __list_addErr1REQUIRES_VIOLATION, __list_addErr6REQUIRES_VIOLATION, __list_addErr7REQUIRES_VIOLATION, val_from_nodeErr1REQUIRES_VIOLATION, val_from_nodeErr0REQUIRES_VIOLATION, list_moveErr0REQUIRES_VIOLATION, list_moveErr1REQUIRES_VIOLATION, list_moveErr2REQUIRES_VIOLATION, list_moveErr3REQUIRES_VIOLATION, gl_sort_passErr2REQUIRES_VIOLATION, gl_sort_passErr3REQUIRES_VIOLATION, gl_sort_passErr0REQUIRES_VIOLATION, gl_sort_passErr1REQUIRES_VIOLATION, inspectErr25REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr24REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr28REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr26REQUIRES_VIOLATION, inspectErr27REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr29REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr12REQUIRES_VIOLATION, inspectErr10REQUIRES_VIOLATION, inspectErr11REQUIRES_VIOLATION, inspectErr14REQUIRES_VIOLATION, inspectErr15REQUIRES_VIOLATION, inspectErr13REQUIRES_VIOLATION, inspectErr17REQUIRES_VIOLATION, inspectErr16REQUIRES_VIOLATION, inspectErr20REQUIRES_VIOLATION, inspectErr18REQUIRES_VIOLATION, inspectErr19REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr22REQUIRES_VIOLATION, inspectErr23REQUIRES_VIOLATION, inspectErr21REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, list_addErr0REQUIRES_VIOLATION, list_addErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION, __list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, gl_insertErr1REQUIRES_VIOLATION, gl_insertErr5REQUIRES_VIOLATION, gl_insertErr0REQUIRES_VIOLATION, gl_insertErr4REQUIRES_VIOLATION, gl_insertErr2REQUIRES_VIOLATION, gl_insertErr3REQUIRES_VIOLATION, gl_destroyErr4REQUIRES_VIOLATION, gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr3REQUIRES_VIOLATION, gl_destroyErr2REQUIRES_VIOLATION, gl_destroyErr1REQUIRES_VIOLATION, gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr0REQUIRES_VIOLATION, gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, gl_destroyErr5REQUIRES_VIOLATION]=== [2019-11-19 23:00:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:00:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1864801538, now seen corresponding path program 1 times [2019-11-19 23:00:25,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:00:25,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1184113673] [2019-11-19 23:00:25,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d154b2d-ccbb-454d-bbf3-3ba6ddb49438/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-19 23:00:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:00:26,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 23:00:26,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:00:26,034 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 9 treesize of output 3 [2019-11-19 23:00:26,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:00:26,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:26,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:00:26,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:3 [2019-11-19 23:00:26,189 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-19 23:00:26,189 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:00:26,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:00:26,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-19 23:00:26,531 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-19 23:00:26,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-19 23:00:26,542 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-19 23:00:26,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:26,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 23:00:26,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-19 23:00:27,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:27,162 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 16 treesize of output 20 [2019-11-19 23:00:27,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:27,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:27,163 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:00:27,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:27,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:27,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:00:27,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:38 [2019-11-19 23:00:27,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:27,513 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-11-19 23:00:27,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:27,535 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 16 treesize of output 20 [2019-11-19 23:00:27,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:27,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:27,537 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:00:27,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:00:27,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:00:27,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:00:27,831 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (exists ((v_arrayElimCell_58 (_ BitVec 32))) (forall ((v_arrayElimCell_60 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse0 (bvadd |~#gl_list~0.offset| (_ bv4 32)))) (or (and (bvsle (bvadd |__list_add_#in~prev.offset| (_ bv4 32)) v_arrayElimCell_58) (not (bvsle .cse0 v_arrayElimCell_58))) (and (not (= v_arrayElimCell_59 v_arrayElimCell_60)) (= __list_add_~prev.base |~#gl_list~0.base|)) (not (= |__list_add_#in~prev.base| |~#gl_list~0.base|)) (not (bvsle (_ bv0 32) |~#gl_list~0.offset|)) (bvsle .cse0 v_arrayElimCell_59) (not (bvsle |~#gl_list~0.offset| .cse0)) (not (bvsle (bvadd __list_add_~prev.offset (_ bv4 32)) v_arrayElimCell_60)))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:493) 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-19 23:00:27,834 INFO L168 Benchmark]: Toolchain (without parser) took 113683.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 939.3 MB in the beginning and 956.9 MB in the end (delta: -17.5 MB). Peak memory consumption was 191.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:00:27,834 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:00:27,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.48 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.3 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:00:27,835 INFO L168 Benchmark]: Boogie Preprocessor took 104.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:00:27,835 INFO L168 Benchmark]: RCFGBuilder took 1510.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.3 MB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:00:27,835 INFO L168 Benchmark]: TraceAbstraction took 111324.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 972.3 MB in the beginning and 956.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:00:27,837 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 739.48 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.3 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1510.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.3 MB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111324.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 972.3 MB in the beginning and 956.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (exists ((v_arrayElimCell_58 (_ BitVec 32))) (forall ((v_arrayElimCell_60 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse0 (bvadd |~#gl_list~0.offset| (_ bv4 32)))) (or (and (bvsle (bvadd |__list_add_#in~prev.offset| (_ bv4 32)) v_arrayElimCell_58) (not (bvsle .cse0 v_arrayElimCell_58))) (and (not (= v_arrayElimCell_59 v_arrayElimCell_60)) (= __list_add_~prev.base |~#gl_list~0.base|)) (not (= |__list_add_#in~prev.base| |~#gl_list~0.base|)) (not (bvsle (_ bv0 32) |~#gl_list~0.offset|)) (bvsle .cse0 v_arrayElimCell_59) (not (bvsle |~#gl_list~0.offset| .cse0)) (not (bvsle (bvadd __list_add_~prev.offset (_ bv4 32)) v_arrayElimCell_60)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (exists ((v_arrayElimCell_58 (_ BitVec 32))) (forall ((v_arrayElimCell_60 (_ BitVec 32)) (v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse0 (bvadd |~#gl_list~0.offset| (_ bv4 32)))) (or (and (bvsle (bvadd |__list_add_#in~prev.offset| (_ bv4 32)) v_arrayElimCell_58) (not (bvsle .cse0 v_arrayElimCell_58))) (and (not (= v_arrayElimCell_59 v_arrayElimCell_60)) (= __list_add_~prev.base |~#gl_list~0.base|)) (not (= |__list_add_#in~prev.base| |~#gl_list~0.base|)) (not (bvsle (_ bv0 32) |~#gl_list~0.offset|)) (bvsle .cse0 v_arrayElimCell_59) (not (bvsle |~#gl_list~0.offset| .cse0)) (not (bvsle (bvadd __list_add_~prev.offset (_ bv4 32)) v_arrayElimCell_60)))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...