./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 052353e0eb8597d9bdf886ce67e33d52b41bcb80 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 052353e0eb8597d9bdf886ce67e33d52b41bcb80 ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:46:53,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:46:53,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:46:53,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:46:53,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:46:53,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:46:53,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:46:53,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:46:53,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:46:53,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:46:53,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:46:53,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:46:53,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:46:53,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:46:53,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:46:53,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:46:53,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:46:53,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:46:53,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:46:53,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:46:53,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:46:53,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:46:53,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:46:53,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:46:53,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:46:53,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:46:53,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:46:53,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:46:53,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:46:53,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:46:53,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:46:53,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:46:53,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:46:53,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:46:53,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:46:53,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:46:53,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:46:53,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:46:53,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:46:53,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:46:53,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:46:53,914 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 23:46:53,929 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:46:53,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:46:53,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:46:53,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:46:53,932 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:46:53,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:46:53,933 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:46:53,933 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:46:53,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:46:53,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:46:53,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:46:53,934 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:46:53,934 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:46:53,935 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:46:53,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:46:53,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:46:53,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:46:53,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:46:53,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:46:53,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:46:53,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:46:53,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:46:53,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:46:53,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:46:53,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:46:53,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:46:53,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 052353e0eb8597d9bdf886ce67e33d52b41bcb80 [2019-11-15 23:46:53,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:46:53,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:46:53,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:46:53,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:46:53,989 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:46:53,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2019-11-15 23:46:54,055 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data/ffcd96247/e30f3fdd50174c3c840fb0b17234935b/FLAG3381cdbc6 [2019-11-15 23:46:54,609 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:46:54,611 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2019-11-15 23:46:54,633 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data/ffcd96247/e30f3fdd50174c3c840fb0b17234935b/FLAG3381cdbc6 [2019-11-15 23:46:54,917 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data/ffcd96247/e30f3fdd50174c3c840fb0b17234935b [2019-11-15 23:46:54,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:46:54,922 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:46:54,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:46:54,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:46:54,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:46:54,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:54" (1/1) ... [2019-11-15 23:46:54,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6c2dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:54, skipping insertion in model container [2019-11-15 23:46:54,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:54" (1/1) ... [2019-11-15 23:46:54,941 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:46:55,004 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:46:55,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:46:55,599 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:46:55,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:46:55,736 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:46:55,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55 WrapperNode [2019-11-15 23:46:55,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:46:55,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:46:55,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:46:55,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:46:55,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55" (1/1) ... [2019-11-15 23:46:55,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55" (1/1) ... [2019-11-15 23:46:55,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55" (1/1) ... [2019-11-15 23:46:55,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55" (1/1) ... [2019-11-15 23:46:55,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55" (1/1) ... [2019-11-15 23:46:55,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55" (1/1) ... [2019-11-15 23:46:55,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55" (1/1) ... [2019-11-15 23:46:55,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:46:55,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:46:55,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:46:55,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:46:55,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:46:55,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:46:55,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:46:55,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:46:55,901 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:46:55,901 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 23:46:55,901 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 23:46:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-15 23:46:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-15 23:46:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_prepend [2019-11-15 23:46:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:46:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:46:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:46:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:46:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:46:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:46:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:46:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:46:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:46:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:46:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:46:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:46:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:46:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:46:55,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:46:55,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:46:55,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:46:55,910 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:46:55,910 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:46:55,910 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:46:55,911 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:46:55,911 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:46:55,911 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:46:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:46:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:46:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:46:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:46:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:46:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:46:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:46:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:46:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:46:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:46:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:46:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:46:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:46:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:46:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:46:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:46:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:46:55,915 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:46:55,915 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:46:55,915 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:46:55,915 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:46:55,915 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:46:55,915 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:46:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:46:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:46:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:46:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:46:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:46:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:46:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:46:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:46:55,917 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:46:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:46:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:46:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:46:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:46:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:46:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:46:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:46:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:46:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:46:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:46:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:46:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:46:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:46:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:46:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:46:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:46:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:46:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:46:55,923 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:46:55,923 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:46:55,923 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:46:55,923 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:46:55,923 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:46:55,923 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:46:55,923 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:46:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:46:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:46:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:46:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:46:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:46:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:46:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:46:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:46:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:46:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:46:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:46:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:46:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:46:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:46:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:46:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:46:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:46:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:46:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:46:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:46:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:46:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:46:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:46:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:46:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:46:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:46:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:46:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 23:46:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 23:46:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:46:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:46:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:46:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-15 23:46:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-15 23:46:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:46:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:46:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_prepend [2019-11-15 23:46:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:46:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:46:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:46:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:46:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:46:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:46:56,335 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 23:46:56,778 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:46:56,778 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:46:56,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:56 BoogieIcfgContainer [2019-11-15 23:46:56,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:46:56,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:46:56,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:46:56,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:46:56,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:46:54" (1/3) ... [2019-11-15 23:46:56,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2980e562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:46:56, skipping insertion in model container [2019-11-15 23:46:56,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:55" (2/3) ... [2019-11-15 23:46:56,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2980e562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:46:56, skipping insertion in model container [2019-11-15 23:46:56,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:56" (3/3) ... [2019-11-15 23:46:56,788 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2019-11-15 23:46:56,799 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:46:56,812 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 51 error locations. [2019-11-15 23:46:56,824 INFO L249 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2019-11-15 23:46:56,851 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:46:56,852 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:46:56,852 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:46:56,852 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:46:56,853 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:46:56,853 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:46:56,853 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:46:56,853 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:46:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-11-15 23:46:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:46:56,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:56,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:56,896 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:46:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:56,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1692667775, now seen corresponding path program 1 times [2019-11-15 23:46:56,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:56,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299968126] [2019-11-15 23:46:56,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:56,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:56,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:57,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299968126] [2019-11-15 23:46:57,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:57,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:57,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308559374] [2019-11-15 23:46:57,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:57,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:57,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:57,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:57,164 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2019-11-15 23:46:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:57,665 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2019-11-15 23:46:57,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:57,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 23:46:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:57,697 INFO L225 Difference]: With dead ends: 152 [2019-11-15 23:46:57,698 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 23:46:57,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 23:46:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 126. [2019-11-15 23:46:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 23:46:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2019-11-15 23:46:57,793 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 12 [2019-11-15 23:46:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:57,794 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2019-11-15 23:46:57,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2019-11-15 23:46:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:46:57,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:57,795 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:57,796 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:46:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1692667776, now seen corresponding path program 1 times [2019-11-15 23:46:57,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:57,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987961333] [2019-11-15 23:46:57,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:57,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:57,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:57,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987961333] [2019-11-15 23:46:57,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:57,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:57,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709068950] [2019-11-15 23:46:57,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:57,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:57,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:57,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:57,978 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 4 states. [2019-11-15 23:46:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:58,397 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2019-11-15 23:46:58,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:58,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 23:46:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:58,400 INFO L225 Difference]: With dead ends: 143 [2019-11-15 23:46:58,401 INFO L226 Difference]: Without dead ends: 143 [2019-11-15 23:46:58,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-15 23:46:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2019-11-15 23:46:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 23:46:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2019-11-15 23:46:58,427 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 12 [2019-11-15 23:46:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:58,428 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2019-11-15 23:46:58,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2019-11-15 23:46:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:46:58,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:58,430 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:58,431 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:46:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:58,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1118751876, now seen corresponding path program 1 times [2019-11-15 23:46:58,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:58,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062277172] [2019-11-15 23:46:58,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:58,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:58,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:58,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062277172] [2019-11-15 23:46:58,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:58,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:46:58,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124816950] [2019-11-15 23:46:58,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:46:58,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:58,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:46:58,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:46:58,671 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 8 states. [2019-11-15 23:46:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:59,359 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2019-11-15 23:46:59,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:46:59,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 23:46:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:59,362 INFO L225 Difference]: With dead ends: 147 [2019-11-15 23:46:59,362 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 23:46:59,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:46:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 23:46:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2019-11-15 23:46:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 23:46:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2019-11-15 23:46:59,374 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 19 [2019-11-15 23:46:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:59,375 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2019-11-15 23:46:59,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:46:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2019-11-15 23:46:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:46:59,376 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:59,376 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:59,376 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:46:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:59,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1118751877, now seen corresponding path program 1 times [2019-11-15 23:46:59,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:59,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601782454] [2019-11-15 23:46:59,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:59,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:59,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:59,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601782454] [2019-11-15 23:46:59,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:59,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:46:59,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537865847] [2019-11-15 23:46:59,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:46:59,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:59,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:46:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:46:59,504 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 7 states. [2019-11-15 23:47:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:00,001 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-11-15 23:47:00,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:47:00,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-15 23:47:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:00,003 INFO L225 Difference]: With dead ends: 144 [2019-11-15 23:47:00,003 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 23:47:00,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:47:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 23:47:00,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2019-11-15 23:47:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 23:47:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-11-15 23:47:00,011 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 19 [2019-11-15 23:47:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:00,012 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-11-15 23:47:00,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:47:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-11-15 23:47:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:47:00,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:00,013 INFO L380 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] [2019-11-15 23:47:00,013 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:47:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:00,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1508199616, now seen corresponding path program 1 times [2019-11-15 23:47:00,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:00,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075604824] [2019-11-15 23:47:00,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:47:00,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075604824] [2019-11-15 23:47:00,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:00,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:47:00,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218773148] [2019-11-15 23:47:00,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:47:00,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:00,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:47:00,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:00,162 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 8 states. [2019-11-15 23:47:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:00,769 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2019-11-15 23:47:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:47:00,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-15 23:47:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:00,771 INFO L225 Difference]: With dead ends: 144 [2019-11-15 23:47:00,771 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 23:47:00,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:47:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 23:47:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 124. [2019-11-15 23:47:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 23:47:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2019-11-15 23:47:00,780 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 28 [2019-11-15 23:47:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:00,780 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2019-11-15 23:47:00,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:47:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2019-11-15 23:47:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:47:00,781 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:00,782 INFO L380 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] [2019-11-15 23:47:00,782 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:47:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1508199615, now seen corresponding path program 1 times [2019-11-15 23:47:00,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:00,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512501847] [2019-11-15 23:47:00,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:00,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:47:00,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512501847] [2019-11-15 23:47:00,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:00,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:47:00,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338842885] [2019-11-15 23:47:00,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:47:00,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:47:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:00,960 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 8 states. [2019-11-15 23:47:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:01,556 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2019-11-15 23:47:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:47:01,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-15 23:47:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:01,559 INFO L225 Difference]: With dead ends: 143 [2019-11-15 23:47:01,559 INFO L226 Difference]: Without dead ends: 143 [2019-11-15 23:47:01,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:47:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-15 23:47:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2019-11-15 23:47:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 23:47:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2019-11-15 23:47:01,567 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 28 [2019-11-15 23:47:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:01,568 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2019-11-15 23:47:01,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:47:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2019-11-15 23:47:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:47:01,570 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:01,570 INFO L380 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] [2019-11-15 23:47:01,570 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:47:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:01,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1121775758, now seen corresponding path program 1 times [2019-11-15 23:47:01,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:01,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845132270] [2019-11-15 23:47:01,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:01,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:01,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:47:01,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845132270] [2019-11-15 23:47:01,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718395785] [2019-11-15 23:47:01,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:01,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:47:01,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:02,157 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:47:02,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:02,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-11-15 23:47:02,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:02,194 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 23:47:02,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:02,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-15 23:47:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:47:02,207 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:02,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-15 23:47:02,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992116933] [2019-11-15 23:47:02,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:47:02,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:02,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:47:02,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:47:02,209 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 12 states. [2019-11-15 23:47:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:03,385 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2019-11-15 23:47:03,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:47:03,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-15 23:47:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:03,387 INFO L225 Difference]: With dead ends: 143 [2019-11-15 23:47:03,387 INFO L226 Difference]: Without dead ends: 143 [2019-11-15 23:47:03,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:47:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-15 23:47:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 122. [2019-11-15 23:47:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 23:47:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2019-11-15 23:47:03,397 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 31 [2019-11-15 23:47:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:03,398 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2019-11-15 23:47:03,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:47:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2019-11-15 23:47:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:47:03,400 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:03,400 INFO L380 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] [2019-11-15 23:47:03,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:03,609 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:47:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1121775757, now seen corresponding path program 1 times [2019-11-15 23:47:03,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:03,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115004502] [2019-11-15 23:47:03,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:03,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:03,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:47:03,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115004502] [2019-11-15 23:47:03,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124430644] [2019-11-15 23:47:03,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:03,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 23:47:03,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:03,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:47:03,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:03,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:03,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:03,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 23:47:04,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:04,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 33 [2019-11-15 23:47:04,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:04,247 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-15 23:47:04,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:04,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-11-15 23:47:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:47:04,285 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:04,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 23:47:04,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063011085] [2019-11-15 23:47:04,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:47:04,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:04,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:47:04,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:47:04,292 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 16 states. [2019-11-15 23:47:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:05,676 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-11-15 23:47:05,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:47:05,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-15 23:47:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:05,679 INFO L225 Difference]: With dead ends: 142 [2019-11-15 23:47:05,679 INFO L226 Difference]: Without dead ends: 142 [2019-11-15 23:47:05,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:47:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-15 23:47:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 121. [2019-11-15 23:47:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:47:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-15 23:47:05,688 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 31 [2019-11-15 23:47:05,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:05,690 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-15 23:47:05,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:47:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-15 23:47:05,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:47:05,698 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:05,699 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:05,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:05,912 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:47:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1086588600, now seen corresponding path program 1 times [2019-11-15 23:47:05,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:05,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99943051] [2019-11-15 23:47:05,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:05,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:05,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:06,807 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-11-15 23:47:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:47:07,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99943051] [2019-11-15 23:47:07,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408550467] [2019-11-15 23:47:07,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:07,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 23:47:07,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:07,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:47:07,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:07,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:47:07,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 23:47:07,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:07,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:47:07,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,456 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:47:07,456 INFO L375 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 23:47:07,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:07,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:07,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2019-11-15 23:47:07,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:47:07,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:07,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 23:47:07,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:07,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:07,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-15 23:47:07,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:07,716 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-15 23:47:07,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:07,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-15 23:47:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 23:47:07,787 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:07,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2019-11-15 23:47:07,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232297930] [2019-11-15 23:47:07,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:47:07,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:47:07,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:47:07,792 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 22 states. [2019-11-15 23:47:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:09,725 INFO L93 Difference]: Finished difference Result 228 states and 246 transitions. [2019-11-15 23:47:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:47:09,725 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-15 23:47:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:09,728 INFO L225 Difference]: With dead ends: 228 [2019-11-15 23:47:09,728 INFO L226 Difference]: Without dead ends: 228 [2019-11-15 23:47:09,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2019-11-15 23:47:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-15 23:47:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 147. [2019-11-15 23:47:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 23:47:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 176 transitions. [2019-11-15 23:47:09,737 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 176 transitions. Word has length 47 [2019-11-15 23:47:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:09,738 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 176 transitions. [2019-11-15 23:47:09,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:47:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 176 transitions. [2019-11-15 23:47:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:47:09,740 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:09,740 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:09,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:09,944 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:47:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:09,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1086588601, now seen corresponding path program 1 times [2019-11-15 23:47:09,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:09,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004678082] [2019-11-15 23:47:09,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:09,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:09,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:47:10,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004678082] [2019-11-15 23:47:10,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649020588] [2019-11-15 23:47:10,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:10,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 23:47:10,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:10,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:47:10,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:10,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:10,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:10,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:47:10,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 23:47:10,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:10,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:10,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:10,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:47:10,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:10,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:10,825 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:47:10,826 INFO L375 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 23:47:10,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:10,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:10,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:10,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-15 23:47:10,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:10,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:47:10,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:10,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:10,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:10,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 23:47:10,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:10,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:10,995 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:10,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-15 23:47:10,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:11,022 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-15 23:47:11,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:11,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-15 23:47:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 23:47:11,064 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:11,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-15 23:47:11,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462282945] [2019-11-15 23:47:11,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:47:11,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:47:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:47:11,065 INFO L87 Difference]: Start difference. First operand 147 states and 176 transitions. Second operand 18 states. [2019-11-15 23:47:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:12,367 INFO L93 Difference]: Finished difference Result 237 states and 255 transitions. [2019-11-15 23:47:12,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:47:12,368 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-11-15 23:47:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:12,371 INFO L225 Difference]: With dead ends: 237 [2019-11-15 23:47:12,371 INFO L226 Difference]: Without dead ends: 237 [2019-11-15 23:47:12,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:47:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-15 23:47:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 156. [2019-11-15 23:47:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-15 23:47:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2019-11-15 23:47:12,384 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 47 [2019-11-15 23:47:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:12,385 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2019-11-15 23:47:12,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:47:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2019-11-15 23:47:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:47:12,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:12,388 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:12,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:12,591 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:47:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:12,591 INFO L82 PathProgramCache]: Analyzing trace with hash -607409150, now seen corresponding path program 1 times [2019-11-15 23:47:12,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:12,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602745508] [2019-11-15 23:47:12,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:12,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 23:47:12,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602745508] [2019-11-15 23:47:12,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:12,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:47:12,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167626345] [2019-11-15 23:47:12,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:47:12,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:47:12,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:12,750 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand 8 states. [2019-11-15 23:47:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:13,233 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2019-11-15 23:47:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:47:13,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-15 23:47:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:13,235 INFO L225 Difference]: With dead ends: 173 [2019-11-15 23:47:13,236 INFO L226 Difference]: Without dead ends: 173 [2019-11-15 23:47:13,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:47:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-15 23:47:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2019-11-15 23:47:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 23:47:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2019-11-15 23:47:13,247 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 50 [2019-11-15 23:47:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:13,248 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2019-11-15 23:47:13,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:47:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2019-11-15 23:47:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:47:13,255 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:13,255 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:13,256 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:47:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash -607409149, now seen corresponding path program 1 times [2019-11-15 23:47:13,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:13,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027589255] [2019-11-15 23:47:13,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:13,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:13,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:47:13,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027589255] [2019-11-15 23:47:13,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:13,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:47:13,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61752653] [2019-11-15 23:47:13,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:47:13,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:13,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:47:13,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:13,440 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand 8 states. [2019-11-15 23:47:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:14,064 INFO L93 Difference]: Finished difference Result 171 states and 195 transitions. [2019-11-15 23:47:14,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:47:14,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-15 23:47:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:14,066 INFO L225 Difference]: With dead ends: 171 [2019-11-15 23:47:14,066 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 23:47:14,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:47:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 23:47:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2019-11-15 23:47:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 23:47:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2019-11-15 23:47:14,073 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 50 [2019-11-15 23:47:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:14,073 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2019-11-15 23:47:14,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:47:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2019-11-15 23:47:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:47:14,075 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:14,075 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:14,075 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:47:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1649568066, now seen corresponding path program 1 times [2019-11-15 23:47:14,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:14,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007978124] [2019-11-15 23:47:14,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:14,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:14,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:47:14,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007978124] [2019-11-15 23:47:14,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194531657] [2019-11-15 23:47:14,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:14,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 23:47:14,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:15,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-15 23:47:15,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:15,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:15,163 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_2| vanished before elimination [2019-11-15 23:47:15,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:15,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-15 23:47:26,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:26,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-15 23:47:26,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:26,488 INFO L567 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-11-15 23:47:26,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:26,501 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 23:47:26,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2019-11-15 23:47:26,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:26,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:26,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:26,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:30 [2019-11-15 23:47:28,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:28,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:47:28,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:28,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:28,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:28,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2019-11-15 23:47:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:47:28,413 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:28,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 30 [2019-11-15 23:47:28,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355481990] [2019-11-15 23:47:28,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 23:47:28,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 23:47:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=840, Unknown=8, NotChecked=0, Total=930 [2019-11-15 23:47:28,416 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand 31 states. [2019-11-15 23:47:39,073 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-11-15 23:48:00,270 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-11-15 23:48:04,001 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-11-15 23:48:05,559 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-11-15 23:48:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:16,711 INFO L93 Difference]: Finished difference Result 177 states and 200 transitions. [2019-11-15 23:48:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 23:48:16,712 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2019-11-15 23:48:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:16,713 INFO L225 Difference]: With dead ends: 177 [2019-11-15 23:48:16,713 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 23:48:16,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=213, Invalid=1932, Unknown=17, NotChecked=0, Total=2162 [2019-11-15 23:48:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 23:48:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2019-11-15 23:48:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 23:48:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2019-11-15 23:48:16,724 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 51 [2019-11-15 23:48:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:16,725 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2019-11-15 23:48:16,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 23:48:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2019-11-15 23:48:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:48:16,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:16,726 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:16,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:16,930 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:48:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:16,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1649568065, now seen corresponding path program 1 times [2019-11-15 23:48:16,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:16,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900066589] [2019-11-15 23:48:16,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:16,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:16,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:48:17,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900066589] [2019-11-15 23:48:17,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385342564] [2019-11-15 23:48:17,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-15 23:48:17,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:17,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:48:17,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:17,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:17,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:17,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:48:18,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-15 23:48:18,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:18,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:18,179 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_5| vanished before elimination [2019-11-15 23:48:18,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-15 23:48:18,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:18,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:18,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:18,191 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:10 [2019-11-15 23:48:29,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:29,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-15 23:48:29,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:29,889 INFO L567 ElimStorePlain]: treesize reduction 26, result has 74.0 percent of original size [2019-11-15 23:48:29,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:29,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:29,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2019-11-15 23:48:29,899 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:29,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:29,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:29,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:29,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-11-15 23:48:29,922 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:29,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:29,936 INFO L496 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. [2019-11-15 23:48:29,936 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:75, output treesize:44 [2019-11-15 23:48:30,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:30,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:48:30,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:30,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:30,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:30,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:48:30,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:30,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:30,037 INFO L496 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. [2019-11-15 23:48:30,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:14 [2019-11-15 23:48:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:48:30,056 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:30,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2019-11-15 23:48:30,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082029749] [2019-11-15 23:48:30,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 23:48:30,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:30,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 23:48:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=897, Unknown=6, NotChecked=0, Total=992 [2019-11-15 23:48:30,059 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand 32 states. [2019-11-15 23:48:53,525 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-11-15 23:48:57,886 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-15 23:49:02,055 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-15 23:49:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:03,374 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-11-15 23:49:03,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:49:03,375 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2019-11-15 23:49:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:03,376 INFO L225 Difference]: With dead ends: 196 [2019-11-15 23:49:03,377 INFO L226 Difference]: Without dead ends: 196 [2019-11-15 23:49:03,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=200, Invalid=1770, Unknown=10, NotChecked=0, Total=1980 [2019-11-15 23:49:03,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-15 23:49:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 168. [2019-11-15 23:49:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:49:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 194 transitions. [2019-11-15 23:49:03,385 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 194 transitions. Word has length 51 [2019-11-15 23:49:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:03,385 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 194 transitions. [2019-11-15 23:49:03,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 23:49:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 194 transitions. [2019-11-15 23:49:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:49:03,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:03,386 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:03,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:03,591 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:49:03,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1503224856, now seen corresponding path program 1 times [2019-11-15 23:49:03,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:03,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890909062] [2019-11-15 23:49:03,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:03,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:03,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:49:04,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890909062] [2019-11-15 23:49:04,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041253445] [2019-11-15 23:49:04,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 23:49:04,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:04,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:49:04,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:04,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:04,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:04,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-15 23:49:04,902 INFO L341 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-15 23:49:04,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2019-11-15 23:49:04,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:04,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:04,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:04,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-11-15 23:49:05,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:05,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2019-11-15 23:49:05,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:05,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:05,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:05,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:5 [2019-11-15 23:49:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:49:05,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:49:05,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [23] total 32 [2019-11-15 23:49:05,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917249767] [2019-11-15 23:49:05,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:49:05,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:05,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:49:05,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 23:49:05,105 INFO L87 Difference]: Start difference. First operand 168 states and 194 transitions. Second operand 14 states. [2019-11-15 23:49:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:05,949 INFO L93 Difference]: Finished difference Result 202 states and 234 transitions. [2019-11-15 23:49:05,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:49:05,950 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-11-15 23:49:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:05,951 INFO L225 Difference]: With dead ends: 202 [2019-11-15 23:49:05,951 INFO L226 Difference]: Without dead ends: 202 [2019-11-15 23:49:05,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=1434, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 23:49:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-15 23:49:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 177. [2019-11-15 23:49:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-15 23:49:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 206 transitions. [2019-11-15 23:49:05,959 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 206 transitions. Word has length 55 [2019-11-15 23:49:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:05,960 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 206 transitions. [2019-11-15 23:49:05,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:49:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 206 transitions. [2019-11-15 23:49:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:49:05,961 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:05,961 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:06,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:06,165 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:49:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:06,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1503224857, now seen corresponding path program 1 times [2019-11-15 23:49:06,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:06,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141782343] [2019-11-15 23:49:06,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:06,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:06,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:49:06,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141782343] [2019-11-15 23:49:06,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365452419] [2019-11-15 23:49:06,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/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 [2019-11-15 23:49:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:06,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 23:49:06,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:07,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:49:07,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:07,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:49:07,225 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:07,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2019-11-15 23:49:07,302 INFO L341 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-11-15 23:49:07,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 61 [2019-11-15 23:49:07,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:07,340 INFO L341 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-11-15 23:49:07,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 51 [2019-11-15 23:49:07,341 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:07,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,356 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:70 [2019-11-15 23:49:07,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:07,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2019-11-15 23:49:07,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:07,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:07,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2019-11-15 23:49:07,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:07,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:13 [2019-11-15 23:49:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:49:07,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:49:07,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [21] total 33 [2019-11-15 23:49:07,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264063701] [2019-11-15 23:49:07,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:49:07,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:07,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:49:07,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 23:49:07,632 INFO L87 Difference]: Start difference. First operand 177 states and 206 transitions. Second operand 14 states. [2019-11-15 23:49:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:08,649 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2019-11-15 23:49:08,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:49:08,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-11-15 23:49:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:08,651 INFO L225 Difference]: With dead ends: 202 [2019-11-15 23:49:08,651 INFO L226 Difference]: Without dead ends: 202 [2019-11-15 23:49:08,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=125, Invalid=1435, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 23:49:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-15 23:49:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 177. [2019-11-15 23:49:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-15 23:49:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2019-11-15 23:49:08,659 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 55 [2019-11-15 23:49:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:08,659 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2019-11-15 23:49:08,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:49:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2019-11-15 23:49:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:49:08,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:08,664 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:08,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:08,869 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:49:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash 696536000, now seen corresponding path program 1 times [2019-11-15 23:49:08,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:08,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130796355] [2019-11-15 23:49:08,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:08,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:08,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:10,197 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 23:49:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:49:10,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130796355] [2019-11-15 23:49:10,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682393211] [2019-11-15 23:49:10,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:10,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 126 conjunts are in the unsatisfiable core [2019-11-15 23:49:10,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:10,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:10,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 23:49:10,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:10,968 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-15 23:49:10,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:10,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-11-15 23:49:11,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:49:11,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:11,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:11,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:49:11,130 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:11,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:11,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:11,145 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-11-15 23:49:11,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2019-11-15 23:49:11,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:11,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:11,331 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:11,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:11,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2019-11-15 23:49:11,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:11,344 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:11,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:11,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:11,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:73 [2019-11-15 23:49:12,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2019-11-15 23:49:12,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:12,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:12,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:12,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 112 [2019-11-15 23:49:12,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:12,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:12,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:12,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:12,073 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:12,113 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.0 percent of original size [2019-11-15 23:49:12,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:12,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:12,128 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:12,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-11-15 23:49:12,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:12,129 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:12,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:12,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:12,143 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:173, output treesize:10 [2019-11-15 23:49:14,595 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:14,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 149 [2019-11-15 23:49:14,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:14,726 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 23:49:14,727 INFO L567 ElimStorePlain]: treesize reduction 76, result has 76.1 percent of original size [2019-11-15 23:49:14,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,823 INFO L341 Elim1Store]: treesize reduction 33, result has 72.0 percent of original size [2019-11-15 23:49:14,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 202 [2019-11-15 23:49:14,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:14,935 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-11-15 23:49:14,935 INFO L567 ElimStorePlain]: treesize reduction 225, result has 50.2 percent of original size [2019-11-15 23:49:14,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:14,945 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:15,092 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-11-15 23:49:15,092 INFO L341 Elim1Store]: treesize reduction 78, result has 63.7 percent of original size [2019-11-15 23:49:15,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 193 treesize of output 234 [2019-11-15 23:49:15,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:15,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:15,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:15,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:15,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:15,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:15,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:15,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:15,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:15,106 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:15,269 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-11-15 23:49:15,269 INFO L567 ElimStorePlain]: treesize reduction 198, result has 45.8 percent of original size [2019-11-15 23:49:15,270 INFO L496 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. [2019-11-15 23:49:15,270 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:224, output treesize:212 [2019-11-15 23:49:16,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:16,263 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:16,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 196 treesize of output 193 [2019-11-15 23:49:16,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:16,407 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-11-15 23:49:16,407 INFO L567 ElimStorePlain]: treesize reduction 92, result has 58.7 percent of original size [2019-11-15 23:49:16,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:16,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:251, output treesize:131 [2019-11-15 23:49:16,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:16,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:16,892 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:16,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:16,926 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:16,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 86 [2019-11-15 23:49:16,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:16,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:16,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:16,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:16,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:16,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:16,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:16,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:16,931 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:16,994 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-11-15 23:49:16,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:16,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:118, output treesize:28 [2019-11-15 23:49:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:49:17,191 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:17,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33] total 61 [2019-11-15 23:49:17,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545622616] [2019-11-15 23:49:17,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-15 23:49:17,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:17,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-15 23:49:17,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3562, Unknown=1, NotChecked=0, Total=3782 [2019-11-15 23:49:17,194 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand 62 states. [2019-11-15 23:49:17,584 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 23:49:28,295 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-11-15 23:49:30,484 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-11-15 23:49:31,505 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-15 23:49:32,274 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 23:49:34,907 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-15 23:49:37,236 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 112 [2019-11-15 23:49:37,585 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-11-15 23:49:38,744 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 141 DAG size of output: 130 [2019-11-15 23:49:39,385 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2019-11-15 23:49:39,842 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-11-15 23:49:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:43,993 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2019-11-15 23:49:43,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 23:49:43,993 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 56 [2019-11-15 23:49:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:43,995 INFO L225 Difference]: With dead ends: 202 [2019-11-15 23:49:43,995 INFO L226 Difference]: Without dead ends: 202 [2019-11-15 23:49:43,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=484, Invalid=6485, Unknown=3, NotChecked=0, Total=6972 [2019-11-15 23:49:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-15 23:49:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 174. [2019-11-15 23:49:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 23:49:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2019-11-15 23:49:44,008 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 56 [2019-11-15 23:49:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:44,009 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2019-11-15 23:49:44,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-11-15 23:49:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2019-11-15 23:49:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:49:44,010 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:44,011 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:44,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:44,216 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 23:49:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash 696536001, now seen corresponding path program 1 times [2019-11-15 23:49:44,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:44,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791497878] [2019-11-15 23:49:44,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:44,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:44,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:46,449 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 23:49:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:49:46,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791497878] [2019-11-15 23:49:46,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790233485] [2019-11-15 23:49:46,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:46,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 137 conjunts are in the unsatisfiable core [2019-11-15 23:49:46,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:46,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:49:46,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:46,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:46,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:46,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:49:47,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:47,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 23:49:47,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:47,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:47,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:47,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:49:47,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:47,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:47,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:47,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2019-11-15 23:49:47,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:49:47,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:47,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:47,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:49:47,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:47,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:47,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:47,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-11-15 23:49:47,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:47,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 62 [2019-11-15 23:49:47,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:47,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:47,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:47,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-15 23:49:47,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:47,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:47,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:47,735 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2019-11-15 23:49:48,478 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_23|], 1=[|v_#length_BEFORE_CALL_18|]} [2019-11-15 23:49:48,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-15 23:49:48,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:48,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:48,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2019-11-15 23:49:48,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:48,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:48,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:49:48,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:48,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 72 [2019-11-15 23:49:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:48,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:48,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:48,594 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:48,670 INFO L567 ElimStorePlain]: treesize reduction 20, result has 75.0 percent of original size [2019-11-15 23:49:48,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:48,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2019-11-15 23:49:48,684 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:48,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:48,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:48,698 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:146, output treesize:13 [2019-11-15 23:50:05,194 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_BEFORE_CALL_24|], 3=[|v_old(#length)_AFTER_CALL_38|]} [2019-11-15 23:50:05,214 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:05,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 23:50:05,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:05,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:05,304 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:05,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 88 [2019-11-15 23:50:05,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:05,420 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 23:50:05,420 INFO L567 ElimStorePlain]: treesize reduction 50, result has 78.9 percent of original size [2019-11-15 23:50:05,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:05,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:05,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:05,597 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-11-15 23:50:05,597 INFO L341 Elim1Store]: treesize reduction 78, result has 63.7 percent of original size [2019-11-15 23:50:05,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 200 [2019-11-15 23:50:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,612 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:05,746 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-11-15 23:50:05,746 INFO L567 ElimStorePlain]: treesize reduction 121, result has 56.3 percent of original size [2019-11-15 23:50:05,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:05,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:05,836 INFO L341 Elim1Store]: treesize reduction 33, result has 67.6 percent of original size [2019-11-15 23:50:05,836 INFO L375 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 120 [2019-11-15 23:50:05,837 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:05,952 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-11-15 23:50:05,952 INFO L567 ElimStorePlain]: treesize reduction 47, result has 76.3 percent of original size [2019-11-15 23:50:05,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:05,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:05,955 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:194, output treesize:220 [2019-11-15 23:50:05,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:05,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:06,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:06,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:06,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:06,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:06,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:50:07,214 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-15 23:50:07,763 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-15 23:50:07,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:08,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:50:08,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:08,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 204 treesize of output 162 [2019-11-15 23:50:08,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,482 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:08,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:08,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 116 [2019-11-15 23:50:08,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:08,517 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:08,648 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-11-15 23:50:08,649 INFO L567 ElimStorePlain]: treesize reduction 76, result has 68.3 percent of original size [2019-11-15 23:50:08,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:08,851 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) 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:292) 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.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 23:50:08,854 INFO L168 Benchmark]: Toolchain (without parser) took 193932.90 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 501.7 MB). Free memory was 940.7 MB in the beginning and 927.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 515.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:08,855 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:50:08,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:08,855 INFO L168 Benchmark]: Boogie Preprocessor took 88.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:50:08,856 INFO L168 Benchmark]: RCFGBuilder took 953.59 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: 74.9 MB). Peak memory consumption was 74.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:08,857 INFO L168 Benchmark]: TraceAbstraction took 192072.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.1 MB). Free memory was 1.1 GB in the beginning and 927.3 MB in the end (delta: 132.2 MB). Peak memory consumption was 469.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:08,858 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 814.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 953.59 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: 74.9 MB). Peak memory consumption was 74.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 192072.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.1 MB). Free memory was 1.1 GB in the beginning and 927.3 MB in the end (delta: 132.2 MB). Peak memory consumption was 469.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:50:11,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:50:11,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:50:11,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:50:11,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:50:11,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:50:11,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:50:11,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:50:11,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:50:11,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:50:11,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:50:11,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:50:11,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:50:11,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:50:11,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:50:11,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:50:11,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:50:11,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:50:11,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:50:11,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:50:11,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:50:11,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:50:11,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:50:11,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:50:11,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:50:11,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:50:11,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:50:11,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:50:11,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:50:11,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:50:11,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:50:11,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:50:11,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:50:11,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:50:11,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:50:11,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:50:11,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:50:11,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:50:11,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:50:11,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:50:11,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:50:11,397 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 23:50:11,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:50:11,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:50:11,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:50:11,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:50:11,415 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:50:11,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:50:11,416 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:50:11,416 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:50:11,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:50:11,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:50:11,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:50:11,417 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:50:11,418 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:50:11,418 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:50:11,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:50:11,418 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:50:11,419 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:50:11,419 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:50:11,419 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:50:11,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:50:11,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:50:11,420 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:50:11,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:50:11,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:50:11,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:50:11,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:50:11,422 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:50:11,422 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:50:11,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:50:11,423 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 052353e0eb8597d9bdf886ce67e33d52b41bcb80 [2019-11-15 23:50:11,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:50:11,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:50:11,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:50:11,482 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:50:11,482 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:50:11,483 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2019-11-15 23:50:11,544 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data/237a1126c/d8b2860a2ff247ef9461f30c62f52e2a/FLAGa6aace19b [2019-11-15 23:50:12,087 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:50:12,088 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2019-11-15 23:50:12,103 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data/237a1126c/d8b2860a2ff247ef9461f30c62f52e2a/FLAGa6aace19b [2019-11-15 23:50:12,423 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/data/237a1126c/d8b2860a2ff247ef9461f30c62f52e2a [2019-11-15 23:50:12,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:50:12,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:50:12,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:12,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:50:12,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:50:12,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:12" (1/1) ... [2019-11-15 23:50:12,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d0cfa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:12, skipping insertion in model container [2019-11-15 23:50:12,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:12" (1/1) ... [2019-11-15 23:50:12,445 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:50:12,499 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:50:12,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:12,996 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:50:13,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:13,164 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:50:13,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13 WrapperNode [2019-11-15 23:50:13,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:13,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:50:13,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:50:13,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:50:13,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13" (1/1) ... [2019-11-15 23:50:13,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13" (1/1) ... [2019-11-15 23:50:13,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13" (1/1) ... [2019-11-15 23:50:13,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13" (1/1) ... [2019-11-15 23:50:13,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13" (1/1) ... [2019-11-15 23:50:13,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13" (1/1) ... [2019-11-15 23:50:13,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13" (1/1) ... [2019-11-15 23:50:13,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:50:13,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:50:13,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:50:13,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:50:13,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:50:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:50:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:50:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:50:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:50:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 23:50:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 23:50:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-15 23:50:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-15 23:50:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_prepend [2019-11-15 23:50:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:50:13,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:50:13,372 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:50:13,372 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:50:13,373 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:50:13,373 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:50:13,373 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:50:13,373 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:50:13,374 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:50:13,374 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:50:13,374 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:50:13,374 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:50:13,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:50:13,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:50:13,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:50:13,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:50:13,376 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:50:13,376 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:50:13,376 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:50:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:50:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:50:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:50:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:50:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:50:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:50:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:50:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:50:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:50:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:50:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:50:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:50:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:50:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:50:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:50:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:50:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:50:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:50:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:50:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:50:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:50:13,381 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:50:13,381 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:50:13,381 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:50:13,381 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:50:13,382 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:50:13,382 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:50:13,382 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:50:13,382 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:50:13,382 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:50:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:50:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:50:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:50:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:50:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:50:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:50:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:50:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:50:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:50:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:50:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:50:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:50:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:50:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:50:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:50:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:50:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:50:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:50:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:50:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:50:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:50:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:50:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:50:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:50:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:50:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:50:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:50:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:50:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:50:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:50:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:50:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:50:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:50:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:50:13,389 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:50:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:50:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:50:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:50:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:50:13,390 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:50:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:50:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:50:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:50:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:50:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:50:13,391 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:50:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:50:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:50:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:50:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:50:13,392 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:50:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:50:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:50:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:50:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:50:13,393 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:50:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:50:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:50:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 23:50:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 23:50:13,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:50:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:50:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:50:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-15 23:50:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-15 23:50:13,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:50:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:50:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_prepend [2019-11-15 23:50:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:50:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:50:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:50:13,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:50:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:50:13,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:50:13,765 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 23:50:14,521 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:50:14,522 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:50:14,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:14 BoogieIcfgContainer [2019-11-15 23:50:14,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:50:14,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:50:14,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:50:14,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:50:14,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:50:12" (1/3) ... [2019-11-15 23:50:14,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf28294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:50:14, skipping insertion in model container [2019-11-15 23:50:14,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:13" (2/3) ... [2019-11-15 23:50:14,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf28294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:50:14, skipping insertion in model container [2019-11-15 23:50:14,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:14" (3/3) ... [2019-11-15 23:50:14,543 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2019-11-15 23:50:14,551 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:50:14,559 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 51 error locations. [2019-11-15 23:50:14,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2019-11-15 23:50:14,587 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:50:14,587 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:50:14,587 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:50:14,587 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:50:14,587 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:50:14,588 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:50:14,588 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:50:14,588 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:50:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-11-15 23:50:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:50:14,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:14,621 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:14,624 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:50:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:14,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1692667775, now seen corresponding path program 1 times [2019-11-15 23:50:14,642 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:50:14,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2078094997] [2019-11-15 23:50:14,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_256711cd-8c7c-435c-bcd5-b2559d56c584/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:50:14,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:50:14,876 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:50:14,885 INFO L168 Benchmark]: Toolchain (without parser) took 2455.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -91.2 MB). Peak memory consumption was 63.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:14,886 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:50:14,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:14,889 INFO L168 Benchmark]: Boogie Preprocessor took 139.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:50:14,891 INFO L168 Benchmark]: RCFGBuilder took 1220.31 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: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:14,892 INFO L168 Benchmark]: TraceAbstraction took 352.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:14,905 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 737.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1220.31 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: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 352.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...