./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 cae663252cf3102da91695865874d633c1ee8349 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 cae663252cf3102da91695865874d633c1ee8349 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:42:33,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:42:33,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:42:33,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:42:33,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:42:33,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:42:33,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:42:33,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:42:33,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:42:33,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:42:33,892 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:42:33,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:42:33,893 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:42:33,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:42:33,894 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:42:33,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:42:33,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:42:33,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:42:33,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:42:33,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:42:33,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:42:33,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:42:33,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:42:33,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:42:33,899 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:42:33,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:42:33,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:42:33,900 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:42:33,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:42:33,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:42:33,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:42:33,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:42:33,902 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:42:33,902 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:42:33,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:42:33,903 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:42:33,903 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 05:42:33,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:42:33,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:42:33,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:42:33,910 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:42:33,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:42:33,911 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:42:33,911 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:42:33,911 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:42:33,911 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:42:33,911 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:42:33,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:42:33,911 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:42:33,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:42:33,911 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 05:42:33,912 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 05:42:33,912 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 05:42:33,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:42:33,912 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:42:33,912 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:42:33,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:42:33,912 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:42:33,912 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:42:33,912 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:42:33,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:42:33,912 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:42:33,913 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:42:33,913 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:42:33,913 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:42:33,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 -> cae663252cf3102da91695865874d633c1ee8349 [2018-12-02 05:42:33,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:42:33,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:42:33,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:42:33,939 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:42:33,940 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:42:33,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 05:42:33,974 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data/f80e7cc9d/c427bd1622654957b3c9e024d95bb9ae/FLAG37c8c0666 [2018-12-02 05:42:34,317 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:42:34,317 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 05:42:34,323 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data/f80e7cc9d/c427bd1622654957b3c9e024d95bb9ae/FLAG37c8c0666 [2018-12-02 05:42:34,697 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data/f80e7cc9d/c427bd1622654957b3c9e024d95bb9ae [2018-12-02 05:42:34,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:42:34,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 05:42:34,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:42:34,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:42:34,702 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:42:34,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:42:34" (1/1) ... [2018-12-02 05:42:34,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74eb9a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34, skipping insertion in model container [2018-12-02 05:42:34,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:42:34" (1/1) ... [2018-12-02 05:42:34,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:42:34,728 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:42:34,876 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:42:34,882 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:42:34,940 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:42:34,961 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:42:34,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34 WrapperNode [2018-12-02 05:42:34,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:42:34,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:42:34,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:42:34,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:42:34,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34" (1/1) ... [2018-12-02 05:42:34,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34" (1/1) ... [2018-12-02 05:42:34,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34" (1/1) ... [2018-12-02 05:42:34,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34" (1/1) ... [2018-12-02 05:42:34,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34" (1/1) ... [2018-12-02 05:42:34,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34" (1/1) ... [2018-12-02 05:42:34,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34" (1/1) ... [2018-12-02 05:42:34,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:42:34,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:42:34,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:42:34,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:42:34,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:42:35,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:42:35,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:42:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 05:42:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 05:42:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 05:42:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 05:42:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 05:42:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-02 05:42:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-12-02 05:42:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:42:35,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 05:42:35,035 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 05:42:35,035 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 05:42:35,035 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 05:42:35,035 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 05:42:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 05:42:35,037 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 05:42:35,038 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 05:42:35,039 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 05:42:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 05:42:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:42:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:42:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:42:35,328 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:42:35,328 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 05:42:35,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:42:35 BoogieIcfgContainer [2018-12-02 05:42:35,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:42:35,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:42:35,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:42:35,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:42:35,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:42:34" (1/3) ... [2018-12-02 05:42:35,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3775fdd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:42:35, skipping insertion in model container [2018-12-02 05:42:35,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:34" (2/3) ... [2018-12-02 05:42:35,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3775fdd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:42:35, skipping insertion in model container [2018-12-02 05:42:35,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:42:35" (3/3) ... [2018-12-02 05:42:35,334 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 05:42:35,343 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:42:35,349 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-12-02 05:42:35,361 INFO L257 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2018-12-02 05:42:35,377 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:42:35,377 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:42:35,377 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 05:42:35,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:42:35,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:42:35,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:42:35,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:42:35,378 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:42:35,378 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:42:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-12-02 05:42:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 05:42:35,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:35,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:35,398 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-02 05:42:35,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:35,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1063869761, now seen corresponding path program 1 times [2018-12-02 05:42:35,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:42:35,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:42:35,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:35,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:35,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:35,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:42:35,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:42:35,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:42:35,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:42:35,526 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2018-12-02 05:42:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:35,616 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2018-12-02 05:42:35,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:42:35,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 05:42:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:35,623 INFO L225 Difference]: With dead ends: 108 [2018-12-02 05:42:35,624 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 05:42:35,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:42:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 05:42:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-02 05:42:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 05:42:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-02 05:42:35,652 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 13 [2018-12-02 05:42:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:35,652 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-02 05:42:35,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:42:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-02 05:42:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 05:42:35,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:35,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:35,653 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-02 05:42:35,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1063869760, now seen corresponding path program 1 times [2018-12-02 05:42:35,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:42:35,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:42:35,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:35,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:35,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:35,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:35,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:42:35,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:42:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:42:35,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:42:35,702 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 3 states. [2018-12-02 05:42:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:35,750 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-12-02 05:42:35,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:42:35,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 05:42:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:35,751 INFO L225 Difference]: With dead ends: 99 [2018-12-02 05:42:35,751 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 05:42:35,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:42:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 05:42:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-02 05:42:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 05:42:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-12-02 05:42:35,756 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 13 [2018-12-02 05:42:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:35,757 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-12-02 05:42:35,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:42:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-12-02 05:42:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 05:42:35,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:35,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:35,757 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-02 05:42:35,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash -638174441, now seen corresponding path program 1 times [2018-12-02 05:42:35,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:42:35,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:42:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:35,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:35,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:35,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:42:35,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:42:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:42:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:42:35,804 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 6 states. [2018-12-02 05:42:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:35,933 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-12-02 05:42:35,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:42:35,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 05:42:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:35,935 INFO L225 Difference]: With dead ends: 103 [2018-12-02 05:42:35,935 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 05:42:35,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:42:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 05:42:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-02 05:42:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 05:42:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-02 05:42:35,942 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 19 [2018-12-02 05:42:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:35,942 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-02 05:42:35,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:42:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-02 05:42:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 05:42:35,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:35,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:35,943 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-02 05:42:35,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash -638174440, now seen corresponding path program 1 times [2018-12-02 05:42:35,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:42:35,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:42:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:35,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:35,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:35,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:42:35,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:42:35,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:42:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:42:35,992 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-02 05:42:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:36,099 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-12-02 05:42:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:42:36,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 05:42:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:36,100 INFO L225 Difference]: With dead ends: 102 [2018-12-02 05:42:36,100 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 05:42:36,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:42:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 05:42:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-02 05:42:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 05:42:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-12-02 05:42:36,106 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 19 [2018-12-02 05:42:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:36,106 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-12-02 05:42:36,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:42:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-12-02 05:42:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 05:42:36,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:36,107 INFO L402 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] [2018-12-02 05:42:36,107 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-02 05:42:36,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:36,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1309582990, now seen corresponding path program 1 times [2018-12-02 05:42:36,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:42:36,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:42:36,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:36,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:36,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:36,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:36,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:42:36,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:42:36,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:42:36,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:42:36,141 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 5 states. [2018-12-02 05:42:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:36,159 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-12-02 05:42:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:42:36,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-02 05:42:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:36,160 INFO L225 Difference]: With dead ends: 106 [2018-12-02 05:42:36,160 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 05:42:36,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:42:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 05:42:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-02 05:42:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 05:42:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-02 05:42:36,167 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 25 [2018-12-02 05:42:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:36,167 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-02 05:42:36,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:42:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-02 05:42:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 05:42:36,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:36,168 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:36,169 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-02 05:42:36,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:36,169 INFO L82 PathProgramCache]: Analyzing trace with hash -252497731, now seen corresponding path program 1 times [2018-12-02 05:42:36,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:42:36,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:42:36,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:36,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:36,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 05:42:36,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:42:36,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:42:36,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:36,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:42:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:36,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:42:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 05:42:36,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:42:36,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:42:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:42:36,296 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-02 05:42:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:36,326 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-12-02 05:42:36,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:42:36,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-12-02 05:42:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:36,327 INFO L225 Difference]: With dead ends: 112 [2018-12-02 05:42:36,327 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 05:42:36,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:42:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 05:42:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-12-02 05:42:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 05:42:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-12-02 05:42:36,332 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 38 [2018-12-02 05:42:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:36,332 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-12-02 05:42:36,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:42:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-12-02 05:42:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:42:36,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:36,333 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:36,334 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-02 05:42:36,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash 653716206, now seen corresponding path program 2 times [2018-12-02 05:42:36,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:42:36,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:42:36,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:36,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 05:42:36,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:42:36,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:42:36,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 05:42:36,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 05:42:36,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:42:36,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:42:36,626 INFO L478 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 [2018-12-02 05:42:36,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:42:36,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:42:36,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:42:36,897 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:42:36,898 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 8284 column 44: unknown constant node_create_~temp~0.base at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:164) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:174) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:112) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2018-12-02 05:42:36,903 INFO L168 Benchmark]: Toolchain (without parser) took 2203.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 949.5 MB in the beginning and 818.6 MB in the end (delta: 131.0 MB). Peak memory consumption was 268.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:42:36,906 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:42:36,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:42:36,907 INFO L168 Benchmark]: Boogie Preprocessor took 34.12 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: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2018-12-02 05:42:36,908 INFO L168 Benchmark]: RCFGBuilder took 332.06 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2018-12-02 05:42:36,909 INFO L168 Benchmark]: TraceAbstraction took 1573.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 818.6 MB in the end (delta: 238.5 MB). Peak memory consumption was 238.5 MB. Max. memory is 11.5 GB. [2018-12-02 05:42:36,914 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.12 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: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.06 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1573.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 818.6 MB in the end (delta: 238.5 MB). Peak memory consumption was 238.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 8284 column 44: unknown constant node_create_~temp~0.base de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 8284 column 44: unknown constant node_create_~temp~0.base: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:42:38,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:42:38,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:42:38,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:42:38,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:42:38,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:42:38,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:42:38,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:42:38,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:42:38,210 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:42:38,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:42:38,211 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:42:38,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:42:38,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:42:38,213 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:42:38,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:42:38,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:42:38,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:42:38,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:42:38,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:42:38,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:42:38,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:42:38,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:42:38,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:42:38,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:42:38,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:42:38,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:42:38,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:42:38,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:42:38,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:42:38,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:42:38,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:42:38,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:42:38,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:42:38,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:42:38,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:42:38,224 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-02 05:42:38,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:42:38,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:42:38,234 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:42:38,234 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:42:38,235 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:42:38,235 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:42:38,235 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:42:38,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:42:38,236 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:42:38,236 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:42:38,236 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:42:38,236 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:42:38,236 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:42:38,236 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 05:42:38,236 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 05:42:38,237 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 05:42:38,237 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:42:38,237 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 05:42:38,237 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 05:42:38,237 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:42:38,237 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:42:38,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:42:38,238 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:42:38,238 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:42:38,238 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:42:38,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:42:38,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:42:38,239 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:42:38,239 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-02 05:42:38,239 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:42:38,239 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 05:42:38,239 INFO L133 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/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 -> cae663252cf3102da91695865874d633c1ee8349 [2018-12-02 05:42:38,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:42:38,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:42:38,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:42:38,272 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:42:38,273 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:42:38,273 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 05:42:38,307 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data/7ab06b9ee/9011ded09e184d73833a5e74cc22a1b9/FLAGb565c2cb1 [2018-12-02 05:42:38,753 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:42:38,754 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/sv-benchmarks/c/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 05:42:38,760 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data/7ab06b9ee/9011ded09e184d73833a5e74cc22a1b9/FLAGb565c2cb1 [2018-12-02 05:42:38,768 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/data/7ab06b9ee/9011ded09e184d73833a5e74cc22a1b9 [2018-12-02 05:42:38,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:42:38,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 05:42:38,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:42:38,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:42:38,773 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:42:38,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:42:38" (1/1) ... [2018-12-02 05:42:38,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3782f26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:38, skipping insertion in model container [2018-12-02 05:42:38,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:42:38" (1/1) ... [2018-12-02 05:42:38,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:42:38,805 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:42:38,987 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:42:38,995 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:42:39,064 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:42:39,097 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:42:39,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39 WrapperNode [2018-12-02 05:42:39,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:42:39,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:42:39,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:42:39,098 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:42:39,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39" (1/1) ... [2018-12-02 05:42:39,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39" (1/1) ... [2018-12-02 05:42:39,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39" (1/1) ... [2018-12-02 05:42:39,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39" (1/1) ... [2018-12-02 05:42:39,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39" (1/1) ... [2018-12-02 05:42:39,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39" (1/1) ... [2018-12-02 05:42:39,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39" (1/1) ... [2018-12-02 05:42:39,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:42:39,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:42:39,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:42:39,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:42:39,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:42:39,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:42:39,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:42:39,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 05:42:39,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 05:42:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 05:42:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 05:42:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 05:42:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-02 05:42:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-12-02 05:42:39,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:42:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 05:42:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 05:42:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 05:42:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 05:42:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 05:42:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 05:42:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 05:42:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 05:42:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 05:42:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 05:42:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-02 05:42:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 05:42:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 05:42:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 05:42:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 05:42:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 05:42:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 05:42:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 05:42:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 05:42:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 05:42:39,169 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 05:42:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 05:42:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 05:42:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 05:42:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 05:42:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 05:42:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 05:42:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 05:42:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 05:42:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 05:42:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 05:42:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 05:42:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 05:42:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:42:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:42:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 05:42:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 05:42:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-02 05:42:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 05:42:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:42:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-12-02 05:42:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:42:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 05:42:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 05:42:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:42:39,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:42:39,573 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:42:39,573 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 05:42:39,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:42:39 BoogieIcfgContainer [2018-12-02 05:42:39,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:42:39,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:42:39,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:42:39,576 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:42:39,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:42:38" (1/3) ... [2018-12-02 05:42:39,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c20f4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:42:39, skipping insertion in model container [2018-12-02 05:42:39,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:39" (2/3) ... [2018-12-02 05:42:39,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c20f4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:42:39, skipping insertion in model container [2018-12-02 05:42:39,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:42:39" (3/3) ... [2018-12-02 05:42:39,578 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 05:42:39,584 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:42:39,589 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-12-02 05:42:39,598 INFO L257 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2018-12-02 05:42:39,613 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:42:39,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:42:39,614 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 05:42:39,614 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:42:39,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:42:39,614 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:42:39,614 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:42:39,614 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:42:39,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:42:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-12-02 05:42:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 05:42:39,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:39,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:39,630 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:42:39,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:39,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1063869761, now seen corresponding path program 1 times [2018-12-02 05:42:39,636 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:42:39,636 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:42:39,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:39,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:42:39,733 INFO L478 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 [2018-12-02 05:42:39,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:42:39,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:42:39,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:42:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:39,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:42:39,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:39,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:42:39,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:42:39,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:42:39,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:42:39,759 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2018-12-02 05:42:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:39,909 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2018-12-02 05:42:39,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:42:39,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 05:42:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:39,918 INFO L225 Difference]: With dead ends: 108 [2018-12-02 05:42:39,918 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 05:42:39,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:42:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 05:42:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-02 05:42:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 05:42:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-02 05:42:39,951 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 13 [2018-12-02 05:42:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:39,951 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-02 05:42:39,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:42:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-02 05:42:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 05:42:39,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:39,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:39,952 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:42:39,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1063869760, now seen corresponding path program 1 times [2018-12-02 05:42:39,953 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:42:39,953 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:42:39,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:40,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:42:40,013 INFO L478 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 [2018-12-02 05:42:40,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:42:40,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:42:40,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:42:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:40,023 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:42:40,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:40,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:42:40,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:42:40,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:42:40,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:42:40,025 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 3 states. [2018-12-02 05:42:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:40,152 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-12-02 05:42:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:42:40,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 05:42:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:40,153 INFO L225 Difference]: With dead ends: 99 [2018-12-02 05:42:40,154 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 05:42:40,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:42:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 05:42:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-02 05:42:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 05:42:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-12-02 05:42:40,159 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 13 [2018-12-02 05:42:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:40,160 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-12-02 05:42:40,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:42:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-12-02 05:42:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 05:42:40,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:40,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:40,160 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:42:40,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:40,161 INFO L82 PathProgramCache]: Analyzing trace with hash -638174441, now seen corresponding path program 1 times [2018-12-02 05:42:40,161 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:42:40,161 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:42:40,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:40,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:42:40,217 INFO L478 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 [2018-12-02 05:42:40,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:42:40,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:42:40,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:42:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:40,242 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:42:40,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:40,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:42:40,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:42:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:42:40,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:42:40,244 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 6 states. [2018-12-02 05:42:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:40,551 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-12-02 05:42:40,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:42:40,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 05:42:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:40,553 INFO L225 Difference]: With dead ends: 103 [2018-12-02 05:42:40,553 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 05:42:40,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:42:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 05:42:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-02 05:42:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 05:42:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-02 05:42:40,560 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 19 [2018-12-02 05:42:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:40,560 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-02 05:42:40,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:42:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-02 05:42:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 05:42:40,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:40,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:40,561 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:42:40,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:40,561 INFO L82 PathProgramCache]: Analyzing trace with hash -638174440, now seen corresponding path program 1 times [2018-12-02 05:42:40,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:42:40,562 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:42:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:40,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:42:40,619 INFO L478 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 [2018-12-02 05:42:40,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:42:40,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:42:40,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:42:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:40,657 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:42:40,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:40,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:42:40,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:42:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:42:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:42:40,659 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-02 05:42:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:40,958 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-12-02 05:42:40,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:42:40,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 05:42:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:40,960 INFO L225 Difference]: With dead ends: 102 [2018-12-02 05:42:40,960 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 05:42:40,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:42:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 05:42:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-02 05:42:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 05:42:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-12-02 05:42:40,966 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 19 [2018-12-02 05:42:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:40,967 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-12-02 05:42:40,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:42:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-12-02 05:42:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 05:42:40,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:40,968 INFO L402 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] [2018-12-02 05:42:40,968 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:42:40,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:40,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1309582990, now seen corresponding path program 1 times [2018-12-02 05:42:40,969 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:42:40,969 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:42:40,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:41,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:42:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:41,047 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:42:41,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:41,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:42:41,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:42:41,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:42:41,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:42:41,049 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 5 states. [2018-12-02 05:42:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:41,071 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-12-02 05:42:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:42:41,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-02 05:42:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:41,072 INFO L225 Difference]: With dead ends: 106 [2018-12-02 05:42:41,072 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 05:42:41,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:42:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 05:42:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-02 05:42:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 05:42:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-02 05:42:41,076 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 25 [2018-12-02 05:42:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:41,076 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-02 05:42:41,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:42:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-02 05:42:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 05:42:41,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:41,076 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:41,076 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:42:41,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash -252497731, now seen corresponding path program 1 times [2018-12-02 05:42:41,077 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:42:41,077 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:42:41,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:41,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:42:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:42:41,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:42:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 05:42:41,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:42:41,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-12-02 05:42:41,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:42:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:42:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:42:41,305 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 9 states. [2018-12-02 05:42:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:41,412 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-12-02 05:42:41,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:42:41,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-12-02 05:42:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:41,413 INFO L225 Difference]: With dead ends: 112 [2018-12-02 05:42:41,413 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 05:42:41,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:42:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 05:42:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-12-02 05:42:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 05:42:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-12-02 05:42:41,417 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 38 [2018-12-02 05:42:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:41,418 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-12-02 05:42:41,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:42:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-12-02 05:42:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:42:41,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:41,418 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:41,419 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:42:41,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:41,419 INFO L82 PathProgramCache]: Analyzing trace with hash 653716206, now seen corresponding path program 2 times [2018-12-02 05:42:41,419 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:42:41,419 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:42:41,432 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 05:42:41,548 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-02 05:42:41,548 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 05:42:41,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 05:42:41,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 05:42:41,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 05:42:41,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:42:41,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:42:41,645 INFO L478 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 [2018-12-02 05:42:41,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:42:41,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:42:41,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:42:43,657 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 05:42:44,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:42:44,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:42:44,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:42:44,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-12-02 05:42:44,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-12-02 05:42:44,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:42:44,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:42:44,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:42:44,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2018-12-02 05:42:44,931 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-02 05:42:44,943 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:42:44,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 05:42:44,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:42:44,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:42:44,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-02 05:42:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 19 not checked. [2018-12-02 05:42:44,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:42:48,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:42:48,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-12-02 05:42:48,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:42:48,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:42:48,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=8, NotChecked=42, Total=182 [2018-12-02 05:42:48,798 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 10 states. [2018-12-02 05:43:00,872 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))) is different from true [2018-12-02 05:43:05,399 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 05:43:06,383 WARN L180 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-12-02 05:43:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:40,927 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2018-12-02 05:43:40,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:43:40,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-12-02 05:43:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:40,928 INFO L225 Difference]: With dead ends: 151 [2018-12-02 05:43:40,928 INFO L226 Difference]: Without dead ends: 151 [2018-12-02 05:43:40,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=49, Invalid=136, Unknown=9, NotChecked=78, Total=272 [2018-12-02 05:43:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-02 05:43:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 129. [2018-12-02 05:43:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 05:43:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-12-02 05:43:40,932 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 51 [2018-12-02 05:43:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:40,932 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-12-02 05:43:40,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:43:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-12-02 05:43:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:43:40,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:40,933 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:40,934 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:43:40,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash 653716207, now seen corresponding path program 1 times [2018-12-02 05:43:40,934 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:43:40,934 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:43:40,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:43:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:41,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:43:41,120 INFO L478 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 [2018-12-02 05:43:41,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:43:41,128 INFO L478 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 [2018-12-02 05:43:41,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:43:41,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:43:41,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 05:43:43,147 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 05:43:45,214 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) sll_create_~new_head~0.base (_ bv8 32))) (= (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base) (_ bv0 1)))) is different from true [2018-12-02 05:43:45,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:45,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:45,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 05:43:45,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:45,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2018-12-02 05:43:45,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:43:45,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:43:45,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:45,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:45,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:45,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 05:43:45,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:43:45,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:43:45,329 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:25 [2018-12-02 05:43:47,983 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)))) is different from true [2018-12-02 05:43:47,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:47,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:48,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:48,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 37 [2018-12-02 05:43:48,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 05:43:48,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 05:43:48,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:60 [2018-12-02 05:43:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 26 not checked. [2018-12-02 05:43:48,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:43:51,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:43:51,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:43:51,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:51,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:43:51,699 INFO L478 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 [2018-12-02 05:43:51,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:43:51,707 INFO L478 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 [2018-12-02 05:43:51,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:43:51,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:43:51,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 05:43:52,511 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-12-02 05:43:53,551 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) v_prenex_6 (_ bv8 32))))) is different from true [2018-12-02 05:43:53,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:53,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:53,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 05:43:53,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:43:53,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:53,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 05:43:53,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2018-12-02 05:43:53,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 05:43:53,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:43:53,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 05:43:53,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:42 [2018-12-02 05:43:57,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:57,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:43:57,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-12-02 05:43:57,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 05:43:57,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-02 05:43:57,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:43:57,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 05:43:57,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:61 [2018-12-02 05:43:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 20 not checked. [2018-12-02 05:43:59,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:44:01,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:44:01,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2018-12-02 05:44:01,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 05:44:01,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 05:44:01,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=228, Unknown=10, NotChecked=170, Total=462 [2018-12-02 05:44:01,483 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 20 states. [2018-12-02 05:44:10,907 WARN L180 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-12-02 05:44:19,255 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-02 05:44:25,303 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1))))) is different from true [2018-12-02 05:44:27,308 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_6 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) v_prenex_6 (_ bv8 32))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) |c_sll_create_#t~ret4.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_sll_create_#t~ret4.base|))))) is different from true [2018-12-02 05:44:29,313 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_6 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) v_prenex_6 (_ bv8 32))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) sll_create_~new_head~0.base (_ bv8 32))) (= (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base) (_ bv0 1))))) is different from true [2018-12-02 05:44:33,162 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2018-12-02 05:45:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:45:03,304 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2018-12-02 05:45:03,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:45:03,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-12-02 05:45:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:45:03,305 INFO L225 Difference]: With dead ends: 173 [2018-12-02 05:45:03,305 INFO L226 Difference]: Without dead ends: 173 [2018-12-02 05:45:03,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=94, Invalid=384, Unknown=16, NotChecked=376, Total=870 [2018-12-02 05:45:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-02 05:45:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 143. [2018-12-02 05:45:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-02 05:45:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2018-12-02 05:45:03,309 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 51 [2018-12-02 05:45:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:45:03,309 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2018-12-02 05:45:03,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 05:45:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2018-12-02 05:45:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:45:03,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:45:03,310 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:45:03,310 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:45:03,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:45:03,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1430078092, now seen corresponding path program 1 times [2018-12-02 05:45:03,311 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:45:03,311 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:45:03,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:45:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:45:03,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:45:03,486 INFO L478 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 [2018-12-02 05:45:03,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:03,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:03,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:45:04,213 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 05:45:05,046 WARN L180 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-02 05:45:07,011 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_sll_create_#t~ret4.base| (_ bv1 1))))) is different from true [2018-12-02 05:45:09,015 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_sll_create_~new_head~0.base (_ bv1 1))))) is different from true [2018-12-02 05:45:11,018 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_sll_create_~head~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 05:45:13,025 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_sll_create_#res.base| (_ bv1 1))))) is different from true [2018-12-02 05:45:13,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:13,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:13,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-02 05:45:13,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 05:45:13,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:13,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:13,053 INFO L267 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. [2018-12-02 05:45:13,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-12-02 05:45:15,704 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 05:45:15,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:15,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:15,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:15,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:15,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 55 [2018-12-02 05:45:15,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:15,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-12-02 05:45:15,794 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:45:15,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:15,801 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:45:15,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:15,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:15,820 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:15,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:15,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:62, output treesize:60 [2018-12-02 05:45:15,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-02 05:45:15,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-02 05:45:15,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:15,938 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:45:15,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:15,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:15,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:15,957 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:66, output treesize:42 [2018-12-02 05:45:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 2 refuted. 3 times theorem prover too weak. 1 trivial. 18 not checked. [2018-12-02 05:45:16,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:45:16,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:16,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:16,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:16,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-12-02 05:45:21,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:45:21,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:45:21,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:45:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:45:21,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:45:21,214 INFO L478 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 [2018-12-02 05:45:21,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:21,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:21,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:45:28,870 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 05:45:30,873 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 c_sll_create_~head~0.base)) (= (store .cse0 c_sll_create_~head~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-02 05:45:39,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:39,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:39,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:39,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-12-02 05:45:39,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-12-02 05:45:39,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:39,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:39,794 INFO L267 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. [2018-12-02 05:45:39,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2018-12-02 05:45:40,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:40,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:40,147 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:45:40,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-02 05:45:40,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:40,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-12-02 05:45:40,224 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:45:40,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:45:40,232 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:45:40,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:40,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:40,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:40,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:40,289 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:75 [2018-12-02 05:45:40,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-02 05:45:40,465 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:45:40,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:40,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-12-02 05:45:40,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:45:40,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:45:40,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:40,511 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:84, output treesize:52 [2018-12-02 05:45:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 2 refuted. 3 times theorem prover too weak. 1 trivial. 9 not checked. [2018-12-02 05:45:40,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:45:40,835 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:40,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:40,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:45:40,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-12-02 05:45:45,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:45:45,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2018-12-02 05:45:45,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 05:45:45,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 05:45:45,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1012, Unknown=25, NotChecked=490, Total=1640 [2018-12-02 05:45:45,661 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand 37 states. [2018-12-02 05:46:27,023 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-12-02 05:46:39,694 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 05:47:24,715 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-02 05:47:35,896 WARN L180 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-12-02 05:47:37,472 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-12-02 05:47:53,341 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2018-12-02 05:48:13,041 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-12-02 05:48:23,436 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2018-12-02 05:50:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:50:37,671 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2018-12-02 05:50:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 05:50:37,672 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-12-02 05:50:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:50:37,672 INFO L225 Difference]: With dead ends: 176 [2018-12-02 05:50:37,672 INFO L226 Difference]: Without dead ends: 176 [2018-12-02 05:50:37,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 98.7s TimeCoverageRelationStatistics Valid=216, Invalid=1930, Unknown=44, NotChecked=672, Total=2862 [2018-12-02 05:50:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-02 05:50:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 144. [2018-12-02 05:50:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-02 05:50:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 173 transitions. [2018-12-02 05:50:37,676 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 173 transitions. Word has length 55 [2018-12-02 05:50:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:50:37,677 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 173 transitions. [2018-12-02 05:50:37,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 05:50:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 173 transitions. [2018-12-02 05:50:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:50:37,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:50:37,677 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:50:37,678 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:50:37,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:50:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1430078091, now seen corresponding path program 1 times [2018-12-02 05:50:37,678 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:50:37,678 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/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 [2018-12-02 05:50:37,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:50:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:50:37,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:50:37,917 INFO L478 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 [2018-12-02 05:50:37,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:37,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:37,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:50:39,931 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 05:50:39,939 INFO L478 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 [2018-12-02 05:50:39,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:39,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:39,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-02 05:50:40,935 WARN L180 SmtUtils]: Spent 957.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 05:50:42,961 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 05:50:44,996 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 05:50:45,977 WARN L180 SmtUtils]: Spent 960.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 05:50:45,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:50:45,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:50:45,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-02 05:50:45,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 05:50:45,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:45,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:46,009 INFO L267 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. [2018-12-02 05:50:46,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:33 [2018-12-02 05:50:48,433 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32)))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv8 32))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base))))) is different from true [2018-12-02 05:50:48,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:50:48,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:50:48,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:50:48,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:50:48,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-12-02 05:50:48,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 05:50:48,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-12-02 05:50:48,695 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:50:48,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:50:48,706 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:50:48,706 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 05:50:48,805 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:50:48,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:50:48,816 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:50:48,816 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,826 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:48,869 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:98, output treesize:55 [2018-12-02 05:50:48,951 INFO L478 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 24 treesize of output 22 [2018-12-02 05:50:48,954 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:50:48,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,966 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:50:48,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:48,997 INFO L478 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 36 treesize of output 32 [2018-12-02 05:50:49,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-02 05:50:49,001 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:49,014 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:50:49,014 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:49,019 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:49,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:49,029 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:70, output treesize:22 [2018-12-02 05:50:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2018-12-02 05:50:49,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:50:49,657 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-02 05:50:49,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:49,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:50,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:50,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:51,473 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:51,506 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:51,857 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:51,879 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:52,116 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:52,143 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:50:52,318 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:52,330 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:52,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-02 05:50:52,444 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:190, output treesize:129 [2018-12-02 05:50:57,434 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 72 [2018-12-02 05:50:57,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:50:57,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:50:57,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:50:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:50:57,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:50:57,490 INFO L478 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 [2018-12-02 05:50:57,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:57,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:57,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:50:57,959 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-02 05:50:57,964 INFO L478 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 [2018-12-02 05:50:57,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:50:57,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:50:57,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-02 05:50:59,875 WARN L180 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 05:51:01,349 WARN L180 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 05:51:02,666 WARN L180 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 05:51:04,827 WARN L180 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 05:51:04,832 INFO L478 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 0 case distinctions, treesize of input 17 treesize of output 17 [2018-12-02 05:51:04,836 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-02 05:51:04,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:04,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:51:04,850 INFO L267 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. [2018-12-02 05:51:04,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-12-02 05:51:05,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:51:05,277 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-02 05:51:05,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:51:05,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:51:05,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:51:05,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-12-02 05:51:05,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,459 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-12-02 05:51:05,464 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:51:05,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:51:05,473 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:51:05,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,484 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,549 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 05:51:05,553 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:51:05,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:51:05,560 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:51:05,561 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,567 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,576 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:05,598 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:88, output treesize:54 [2018-12-02 05:51:05,745 INFO L478 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 24 treesize of output 22 [2018-12-02 05:51:05,749 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:51:05,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,761 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:51:05,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,794 INFO L478 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 36 treesize of output 32 [2018-12-02 05:51:05,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-02 05:51:05,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,812 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:51:05,812 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,817 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:51:05,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:05,828 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:70, output treesize:22 [2018-12-02 05:51:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2018-12-02 05:51:05,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:51:05,979 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-02 05:51:06,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:06,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:07,338 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:07,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:08,475 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:08,498 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:51:08,874 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:08,888 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:09,183 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:09,207 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:51:09,408 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 05:51:09,421 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:51:09,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-02 05:51:09,534 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:190, output treesize:129 [2018-12-02 05:51:14,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:51:14,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2018-12-02 05:51:14,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 05:51:14,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 05:51:14,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1029, Unknown=9, NotChecked=198, Total=1332 [2018-12-02 05:51:14,203 INFO L87 Difference]: Start difference. First operand 144 states and 173 transitions. Second operand 33 states. [2018-12-02 05:51:27,778 WARN L180 SmtUtils]: Spent 8.13 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-02 05:51:36,292 WARN L180 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-02 05:51:43,549 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-02 05:51:50,294 WARN L180 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-02 05:52:00,220 WARN L180 SmtUtils]: Spent 9.56 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-02 05:52:12,487 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-02 05:52:22,032 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 42 [2018-12-02 05:52:22,588 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-02 05:52:23,971 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-12-02 05:52:24,746 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-12-02 05:52:33,281 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-12-02 05:52:33,719 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-12-02 05:52:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:52:41,481 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2018-12-02 05:52:41,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 05:52:41,482 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-12-02 05:52:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:52:41,483 INFO L225 Difference]: With dead ends: 193 [2018-12-02 05:52:41,483 INFO L226 Difference]: Without dead ends: 193 [2018-12-02 05:52:41,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 91.0s TimeCoverageRelationStatistics Valid=208, Invalid=2137, Unknown=19, NotChecked=288, Total=2652 [2018-12-02 05:52:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-02 05:52:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 147. [2018-12-02 05:52:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-02 05:52:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 176 transitions. [2018-12-02 05:52:41,486 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 176 transitions. Word has length 55 [2018-12-02 05:52:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:52:41,486 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 176 transitions. [2018-12-02 05:52:41,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 05:52:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 176 transitions. [2018-12-02 05:52:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 05:52:41,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:52:41,487 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:52:41,487 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:52:41,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:52:41,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1938366000, now seen corresponding path program 1 times [2018-12-02 05:52:41,488 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:52:41,488 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:52:41,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:52:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:52:41,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:52:41,632 INFO L478 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 [2018-12-02 05:52:41,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:41,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:41,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:52:41,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 05:52:41,686 INFO L478 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 8 treesize of output 7 [2018-12-02 05:52:41,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:41,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:41,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:41,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 05:52:41,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 05:52:41,722 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 05:52:41,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:41,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:41,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:41,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 05:52:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 05:52:41,749 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:52:41,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:52:41,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:52:41,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:52:41,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:52:41,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:52:41,751 INFO L87 Difference]: Start difference. First operand 147 states and 176 transitions. Second operand 12 states. [2018-12-02 05:52:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:52:42,625 INFO L93 Difference]: Finished difference Result 192 states and 231 transitions. [2018-12-02 05:52:42,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:52:42,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-12-02 05:52:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:52:42,626 INFO L225 Difference]: With dead ends: 192 [2018-12-02 05:52:42,627 INFO L226 Difference]: Without dead ends: 192 [2018-12-02 05:52:42,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:52:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-02 05:52:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2018-12-02 05:52:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-02 05:52:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 188 transitions. [2018-12-02 05:52:42,630 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 188 transitions. Word has length 58 [2018-12-02 05:52:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:52:42,631 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 188 transitions. [2018-12-02 05:52:42,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:52:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 188 transitions. [2018-12-02 05:52:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 05:52:42,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:52:42,632 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:52:42,632 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:52:42,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:52:42,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1938365999, now seen corresponding path program 1 times [2018-12-02 05:52:42,633 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:52:42,633 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:52:42,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:52:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:52:42,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:52:42,798 INFO L478 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 [2018-12-02 05:52:42,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:52:42,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 05:52:42,867 INFO L478 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 8 treesize of output 7 [2018-12-02 05:52:42,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 05:52:42,884 INFO L478 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 8 treesize of output 7 [2018-12-02 05:52:42,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,893 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-12-02 05:52:42,932 INFO L478 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 11 [2018-12-02 05:52:42,933 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:52:42,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 05:52:42,943 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 05:52:42,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:42,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-02 05:52:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 05:52:42,981 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:52:42,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:52:42,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:52:42,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:52:42,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:52:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:52:42,984 INFO L87 Difference]: Start difference. First operand 156 states and 188 transitions. Second operand 12 states. [2018-12-02 05:52:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:52:43,862 INFO L93 Difference]: Finished difference Result 213 states and 253 transitions. [2018-12-02 05:52:43,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:52:43,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-12-02 05:52:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:52:43,864 INFO L225 Difference]: With dead ends: 213 [2018-12-02 05:52:43,864 INFO L226 Difference]: Without dead ends: 213 [2018-12-02 05:52:43,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:52:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-02 05:52:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 170. [2018-12-02 05:52:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-02 05:52:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 204 transitions. [2018-12-02 05:52:43,869 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 204 transitions. Word has length 58 [2018-12-02 05:52:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:52:43,869 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 204 transitions. [2018-12-02 05:52:43,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:52:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 204 transitions. [2018-12-02 05:52:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 05:52:43,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:52:43,870 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:52:43,870 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:52:43,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:52:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash -407019286, now seen corresponding path program 1 times [2018-12-02 05:52:43,871 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:52:43,871 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:52:43,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:52:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:52:44,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:52:44,102 INFO L478 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 [2018-12-02 05:52:44,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:44,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:44,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:52:44,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 05:52:44,282 INFO L478 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 10 treesize of output 9 [2018-12-02 05:52:44,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:44,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:44,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:44,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-02 05:52:44,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:44,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:44,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:44,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-12-02 05:52:44,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2018-12-02 05:52:44,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:44,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:44,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:44,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:47 [2018-12-02 05:52:47,156 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-02 05:52:47,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:47,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:47,179 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:52:47,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 107 [2018-12-02 05:52:47,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 05:52:47,318 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:52:47,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:47,328 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:52:47,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2018-12-02 05:52:47,447 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:52:47,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:47,455 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:52:47,456 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,465 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:47,531 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:128, output treesize:124 [2018-12-02 05:52:47,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-02 05:52:47,673 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:52:47,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,687 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:52:47,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:47,744 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:137, output treesize:117 [2018-12-02 05:52:47,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 70 [2018-12-02 05:52:47,947 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:52:47,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-12-02 05:52:47,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:47,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-12-02 05:52:47,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:47,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:48,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:48,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:50 [2018-12-02 05:52:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-02 05:52:48,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:52:48,763 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-02 05:52:48,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:48,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:48,986 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:48,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:49,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:49,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:68 [2018-12-02 05:52:58,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:52:58,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:52:58,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:52:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:52:58,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:52:58,661 INFO L478 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 [2018-12-02 05:52:58,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:58,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:58,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:52:58,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 05:52:58,754 INFO L478 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 10 treesize of output 9 [2018-12-02 05:52:58,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:58,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:58,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:58,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-02 05:52:58,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:58,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:58,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:58,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-12-02 05:52:58,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2018-12-02 05:52:58,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:58,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:58,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:58,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2018-12-02 05:52:59,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:59,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:59,373 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:52:59,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 113 [2018-12-02 05:52:59,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:59,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 05:52:59,520 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:52:59,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:59,534 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:52:59,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:59,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:59,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:59,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2018-12-02 05:52:59,657 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:52:59,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:52:59,664 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:52:59,665 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:59,674 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:59,695 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:52:59,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:52:59,739 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:127, output treesize:123 [2018-12-02 05:52:59,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-02 05:52:59,957 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:52:59,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:59,970 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:52:59,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:52:59,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:00,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:00,023 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:139, output treesize:119 [2018-12-02 05:53:00,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 72 [2018-12-02 05:53:00,499 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:53:00,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:00,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2018-12-02 05:53:00,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:00,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-12-02 05:53:00,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:00,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:00,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:00,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:120, output treesize:52 [2018-12-02 05:53:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-02 05:53:00,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:53:03,148 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-02 05:53:03,331 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:03,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:03,381 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:03,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:03,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:03,432 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:91 [2018-12-02 05:53:24,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:53:24,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2018-12-02 05:53:24,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 05:53:24,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 05:53:24,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1918, Unknown=9, NotChecked=88, Total=2162 [2018-12-02 05:53:24,964 INFO L87 Difference]: Start difference. First operand 170 states and 204 transitions. Second operand 37 states. [2018-12-02 05:53:34,397 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-02 05:53:38,869 WARN L180 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-02 05:53:42,286 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-12-02 05:53:42,868 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-12-02 05:53:43,909 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-12-02 05:53:44,307 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2018-12-02 05:53:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:46,144 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2018-12-02 05:53:46,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 05:53:46,145 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 59 [2018-12-02 05:53:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:46,146 INFO L225 Difference]: With dead ends: 190 [2018-12-02 05:53:46,146 INFO L226 Difference]: Without dead ends: 190 [2018-12-02 05:53:46,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=293, Invalid=3360, Unknown=11, NotChecked=118, Total=3782 [2018-12-02 05:53:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-02 05:53:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2018-12-02 05:53:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 05:53:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2018-12-02 05:53:46,150 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 59 [2018-12-02 05:53:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:46,150 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2018-12-02 05:53:46,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 05:53:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2018-12-02 05:53:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 05:53:46,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:46,151 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:53:46,151 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_appendErr7REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr6REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION, sll_appendErr8REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr10REQUIRES_VIOLATION, sll_appendErr4REQUIRES_VIOLATION, sll_appendErr11REQUIRES_VIOLATION, sll_appendErr0REQUIRES_VIOLATION, sll_appendErr9REQUIRES_VIOLATION, sll_appendErr5REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 05:53:46,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash -407019285, now seen corresponding path program 1 times [2018-12-02 05:53:46,152 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:53:46,152 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:53:46,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:46,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:53:46,424 INFO L478 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 [2018-12-02 05:53:46,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:53:46,441 INFO L478 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 [2018-12-02 05:53:46,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-02 05:53:46,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:46,606 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 05:53:46,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2018-12-02 05:53:46,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 05:53:46,732 INFO L478 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 10 treesize of output 9 [2018-12-02 05:53:46,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 05:53:46,763 INFO L478 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 10 treesize of output 9 [2018-12-02 05:53:46,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:46,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:71 [2018-12-02 05:53:47,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:47,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:47,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:47,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-12-02 05:53:47,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 48 [2018-12-02 05:53:47,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:47,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:47,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:47,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:70 [2018-12-02 05:53:49,857 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32)))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv8 32))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base))))) is different from true [2018-12-02 05:53:49,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:49,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:49,881 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:53:49,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-12-02 05:53:49,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-12-02 05:53:50,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2018-12-02 05:53:50,192 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:53:50,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:50,205 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:53:50,205 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,218 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 56 [2018-12-02 05:53:50,362 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:53:50,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:50,372 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:53:50,372 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,383 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,400 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:50,450 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:161, output treesize:129 [2018-12-02 05:53:50,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-12-02 05:53:50,872 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2018-12-02 05:53:50,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,896 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:53:50,896 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,913 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:53:50,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:50,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 72 [2018-12-02 05:53:50,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-12-02 05:53:50,983 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:51,017 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:53:51,018 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:51,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-12-02 05:53:51,039 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:51,057 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:51,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:51,081 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:164, output treesize:37 [2018-12-02 05:53:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-02 05:53:51,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:53:52,501 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-02 05:53:52,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:52,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:54,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:54,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:55,593 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:55,629 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:56,108 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:56,133 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:56,536 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:56,568 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:56,819 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:56,841 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:53:57,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-12-02 05:53:57,163 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:240, output treesize:309 [2018-12-02 05:54:15,547 WARN L180 SmtUtils]: Spent 3.93 s on a formula simplification that was a NOOP. DAG size: 97 [2018-12-02 05:54:15,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:54:15,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c153de45-2229-4b83-b8e6-3c4405c6d4c7/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:54:15,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:54:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:54:15,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:54:15,621 INFO L478 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 [2018-12-02 05:54:15,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:54:15,726 INFO L478 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 [2018-12-02 05:54:15,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-02 05:54:15,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:15,765 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 05:54:15,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-12-02 05:54:15,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 05:54:15,791 INFO L478 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 10 treesize of output 9 [2018-12-02 05:54:15,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 05:54:15,826 INFO L478 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 10 treesize of output 9 [2018-12-02 05:54:15,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:71 [2018-12-02 05:54:15,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:15,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:15,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:15,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-12-02 05:54:15,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 48 [2018-12-02 05:54:15,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:15,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-12-02 05:54:16,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:16,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:16,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 66 [2018-12-02 05:54:16,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:16,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:16,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:16,988 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:54:16,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 61 [2018-12-02 05:54:16,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:17,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 56 [2018-12-02 05:54:17,151 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:54:17,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:17,165 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:54:17,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:17,177 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:17,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:17,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2018-12-02 05:54:17,294 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 05:54:17,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:54:17,303 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 05:54:17,303 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:17,313 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:17,340 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:17,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:17,386 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:162, output treesize:126 [2018-12-02 05:54:18,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-12-02 05:54:18,253 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2018-12-02 05:54:18,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:18,277 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:54:18,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:18,293 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:54:18,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:18,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:54:18,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 70 [2018-12-02 05:54:18,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-12-02 05:54:18,375 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:18,409 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 05:54:18,409 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:18,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-12-02 05:54:18,429 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:54:18,443 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:18,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:18,469 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:162, output treesize:35 [2018-12-02 05:54:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-02 05:54:18,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:54:21,510 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-02 05:54:21,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:21,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:23,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:23,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:24,571 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:24,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:25,301 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:25,341 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:25,774 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:25,808 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:26,203 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:26,241 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:54:26,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-12-02 05:54:26,465 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:270, output treesize:378 [2018-12-02 05:54:43,679 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 05:54:43,880 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:54:43,880 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-02 05:54:43,885 INFO L168 Benchmark]: Toolchain (without parser) took 725114.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 939.3 MB in the beginning and 837.3 MB in the end (delta: 102.1 MB). Peak memory consumption was 265.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:54:43,885 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:54:43,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-12-02 05:54:43,886 INFO L168 Benchmark]: Boogie Preprocessor took 35.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-02 05:54:43,886 INFO L168 Benchmark]: RCFGBuilder took 440.97 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:54:43,886 INFO L168 Benchmark]: TraceAbstraction took 724309.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.6 MB). Free memory was 1.1 GB in the beginning and 837.3 MB in the end (delta: 224.1 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:54:43,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 440.97 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 724309.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.6 MB). Free memory was 1.1 GB in the beginning and 837.3 MB in the end (delta: 224.1 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...