./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.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_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 8e9bd4c45107b8bac8caf02aded500b0232909d1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 8e9bd4c45107b8bac8caf02aded500b0232909d1 ................................................................................................................................................................................................................................................................................................................................................................... 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 22:05:57,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:05:57,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:05:57,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:05:57,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:05:57,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:05:57,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:05:57,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:05:57,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:05:57,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:05:57,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:05:57,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:05:57,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:05:57,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:05:57,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:05:57,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:05:57,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:05:57,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:05:57,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:05:57,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:05:57,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:05:57,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:05:57,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:05:57,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:05:57,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:05:57,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:05:57,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:05:57,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:05:57,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:05:57,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:05:57,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:05:57,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:05:57,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:05:57,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:05:57,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:05:57,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:05:57,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:05:57,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:05:57,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:05:57,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:05:57,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:05:57,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:05:57,822 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:05:57,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:05:57,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:05:57,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:05:57,825 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:05:57,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:05:57,825 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:05:57,825 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:05:57,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:05:57,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:05:57,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:05:57,826 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:05:57,827 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:05:57,827 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:05:57,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:05:57,827 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:05:57,828 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:05:57,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:05:57,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:05:57,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:05:57,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:05:57,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:05:57,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:05:57,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:05:57,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:05:57,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:05:57,830 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_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 -> 8e9bd4c45107b8bac8caf02aded500b0232909d1 [2019-11-15 22:05:57,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:05:57,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:05:57,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:05:57,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:05:57,884 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:05:57,885 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2019-11-15 22:05:57,955 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data/6d274f1d5/add4ac4464ee4c3a92f08625de45d46f/FLAG0766288d7 [2019-11-15 22:05:58,587 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:05:58,592 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2019-11-15 22:05:58,606 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data/6d274f1d5/add4ac4464ee4c3a92f08625de45d46f/FLAG0766288d7 [2019-11-15 22:05:58,813 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data/6d274f1d5/add4ac4464ee4c3a92f08625de45d46f [2019-11-15 22:05:58,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:05:58,818 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:05:58,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:05:58,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:05:58,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:05:58,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:05:58" (1/1) ... [2019-11-15 22:05:58,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c4d0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:58, skipping insertion in model container [2019-11-15 22:05:58,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:05:58" (1/1) ... [2019-11-15 22:05:58,838 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:05:58,910 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:05:59,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:05:59,428 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:05:59,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:05:59,552 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:05:59,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59 WrapperNode [2019-11-15 22:05:59,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:05:59,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:05:59,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:05:59,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:05:59,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59" (1/1) ... [2019-11-15 22:05:59,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59" (1/1) ... [2019-11-15 22:05:59,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59" (1/1) ... [2019-11-15 22:05:59,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59" (1/1) ... [2019-11-15 22:05:59,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59" (1/1) ... [2019-11-15 22:05:59,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59" (1/1) ... [2019-11-15 22:05:59,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59" (1/1) ... [2019-11-15 22:05:59,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:05:59,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:05:59,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:05:59,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:05:59,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:05:59,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:05:59,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:05:59,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:05:59,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:05:59,706 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 22:05:59,707 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 22:05:59,708 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-15 22:05:59,709 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_last [2019-11-15 22:05:59,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:05:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:05:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:05:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:05:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:05:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:05:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:05:59,712 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:05:59,712 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:05:59,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:05:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:05:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:05:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:05:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:05:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:05:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:05:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:05:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:05:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:05:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:05:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:05:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:05:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:05:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:05:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:05:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:05:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:05:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:05:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:05:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:05:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:05:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:05:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:05:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:05:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:05:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:05:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:05:59,722 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:05:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:05:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:05:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:05:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:05:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:05:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:05:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:05:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:05:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:05:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:05:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:05:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:05:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:05:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:05:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:05:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:05:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:05:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:05:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:05:59,728 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:05:59,728 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:05:59,728 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:05:59,728 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:05:59,728 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:05:59,729 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:05:59,730 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:05:59,730 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:05:59,730 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:05:59,731 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:05:59,731 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:05:59,732 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:05:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:05:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:05:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:05:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:05:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:05:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:05:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:05:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:05:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:05:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:05:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:05:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:05:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:05:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:05:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:05:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:05:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:05:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:05:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:05:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:05:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:05:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:05:59,736 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:05:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:05:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:05:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:05:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:05:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:05:59,737 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:05:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:05:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:05:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:05:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:05:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:05:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:05:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:05:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:05:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:05:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 22:05:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 22:05:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:05:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:05:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:05:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-15 22:05:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_last [2019-11-15 22:05:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:05:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:05:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:05:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:05:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 22:05:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:05:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:05:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:06:00,126 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 22:06:00,472 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:06:00,472 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 22:06:00,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:06:00 BoogieIcfgContainer [2019-11-15 22:06:00,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:06:00,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:06:00,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:06:00,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:06:00,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:05:58" (1/3) ... [2019-11-15 22:06:00,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae614ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:06:00, skipping insertion in model container [2019-11-15 22:06:00,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:59" (2/3) ... [2019-11-15 22:06:00,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae614ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:06:00, skipping insertion in model container [2019-11-15 22:06:00,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:06:00" (3/3) ... [2019-11-15 22:06:00,482 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2019-11-15 22:06:00,490 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:06:00,497 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-11-15 22:06:00,508 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-11-15 22:06:00,529 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:06:00,529 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:06:00,529 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:06:00,529 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:06:00,529 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:06:00,530 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:06:00,530 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:06:00,530 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:06:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-15 22:06:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:06:00,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:00,563 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:00,564 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:00,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1614276735, now seen corresponding path program 1 times [2019-11-15 22:06:00,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:00,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325671715] [2019-11-15 22:06:00,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:00,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:00,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:00,804 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 22:06:00,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325671715] [2019-11-15 22:06:00,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:00,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:06:00,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782684739] [2019-11-15 22:06:00,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:06:00,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:06:00,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:06:00,830 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2019-11-15 22:06:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:01,258 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-11-15 22:06:01,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:06:01,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 22:06:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:01,275 INFO L225 Difference]: With dead ends: 108 [2019-11-15 22:06:01,275 INFO L226 Difference]: Without dead ends: 101 [2019-11-15 22:06:01,277 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 22:06:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-15 22:06:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-11-15 22:06:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 22:06:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2019-11-15 22:06:01,351 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 12 [2019-11-15 22:06:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:01,352 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2019-11-15 22:06:01,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:06:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2019-11-15 22:06:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:06:01,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:01,353 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:01,354 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:01,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1614276734, now seen corresponding path program 1 times [2019-11-15 22:06:01,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:01,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104062460] [2019-11-15 22:06:01,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:01,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:01,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:01,494 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 22:06:01,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104062460] [2019-11-15 22:06:01,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:01,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:06:01,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327909138] [2019-11-15 22:06:01,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:06:01,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:01,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:06:01,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:06:01,498 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 4 states. [2019-11-15 22:06:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:01,790 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-11-15 22:06:01,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:06:01,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 22:06:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:01,792 INFO L225 Difference]: With dead ends: 99 [2019-11-15 22:06:01,792 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 22:06:01,793 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 22:06:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 22:06:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-15 22:06:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 22:06:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-11-15 22:06:01,819 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 12 [2019-11-15 22:06:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:01,820 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-11-15 22:06:01,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:06:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-11-15 22:06:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:06:01,822 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:01,822 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 22:06:01,823 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:01,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1738238402, now seen corresponding path program 1 times [2019-11-15 22:06:01,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:01,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174960440] [2019-11-15 22:06:01,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:01,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:01,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:02,051 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 22:06:02,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174960440] [2019-11-15 22:06:02,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:02,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:06:02,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243341320] [2019-11-15 22:06:02,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:06:02,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:02,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:06:02,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:06:02,054 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 8 states. [2019-11-15 22:06:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:02,732 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2019-11-15 22:06:02,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:06:02,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 22:06:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:02,738 INFO L225 Difference]: With dead ends: 103 [2019-11-15 22:06:02,739 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 22:06:02,739 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 22:06:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 22:06:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-15 22:06:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 22:06:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-11-15 22:06:02,752 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 19 [2019-11-15 22:06:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:02,753 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-11-15 22:06:02,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:06:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-11-15 22:06:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:06:02,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:02,755 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 22:06:02,756 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:02,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:02,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1738238401, now seen corresponding path program 1 times [2019-11-15 22:06:02,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:02,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180087200] [2019-11-15 22:06:02,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:02,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:02,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:02,883 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 22:06:02,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180087200] [2019-11-15 22:06:02,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:02,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:06:02,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875670676] [2019-11-15 22:06:02,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:06:02,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:02,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:06:02,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:06:02,885 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 7 states. [2019-11-15 22:06:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:03,340 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-11-15 22:06:03,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:06:03,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-15 22:06:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:03,343 INFO L225 Difference]: With dead ends: 100 [2019-11-15 22:06:03,343 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 22:06:03,344 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 22:06:03,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 22:06:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-15 22:06:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 22:06:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-15 22:06:03,353 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 19 [2019-11-15 22:06:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:03,353 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-15 22:06:03,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:06:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-15 22:06:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:06:03,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:03,355 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 22:06:03,356 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:03,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:03,356 INFO L82 PathProgramCache]: Analyzing trace with hash -771999937, now seen corresponding path program 1 times [2019-11-15 22:06:03,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:03,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223721811] [2019-11-15 22:06:03,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:03,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:03,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:03,581 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 22:06:03,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223721811] [2019-11-15 22:06:03,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:03,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:06:03,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653045134] [2019-11-15 22:06:03,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:06:03,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:06:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:06:03,583 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 8 states. [2019-11-15 22:06:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:04,130 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2019-11-15 22:06:04,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:06:04,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-15 22:06:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:04,133 INFO L225 Difference]: With dead ends: 100 [2019-11-15 22:06:04,133 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 22:06:04,133 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 22:06:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 22:06:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-11-15 22:06:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 22:06:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-11-15 22:06:04,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 28 [2019-11-15 22:06:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:04,146 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-11-15 22:06:04,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:06:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-11-15 22:06:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:06:04,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:04,148 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 22:06:04,148 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash -771999936, now seen corresponding path program 1 times [2019-11-15 22:06:04,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:04,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378025083] [2019-11-15 22:06:04,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:04,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:04,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:04,332 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 22:06:04,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378025083] [2019-11-15 22:06:04,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:04,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:06:04,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678254674] [2019-11-15 22:06:04,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:06:04,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:04,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:06:04,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:06:04,336 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 8 states. [2019-11-15 22:06:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:04,815 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-11-15 22:06:04,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:06:04,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-15 22:06:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:04,817 INFO L225 Difference]: With dead ends: 99 [2019-11-15 22:06:04,817 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 22:06:04,818 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 22:06:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 22:06:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-11-15 22:06:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 22:06:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-11-15 22:06:04,825 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 28 [2019-11-15 22:06:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:04,826 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-11-15 22:06:04,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:06:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-11-15 22:06:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:06:04,827 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:04,827 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 22:06:04,828 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:04,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:04,828 INFO L82 PathProgramCache]: Analyzing trace with hash 899872780, now seen corresponding path program 1 times [2019-11-15 22:06:04,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:04,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232188819] [2019-11-15 22:06:04,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:04,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:04,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:05,029 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 22:06:05,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232188819] [2019-11-15 22:06:05,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035810496] [2019-11-15 22:06:05,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:05,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 22:06:05,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:05,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:06:05,356 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:05,357 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 22:06:05,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:05,389 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 22:06:05,390 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 22:06:05,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-15 22:06:05,401 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 22:06:05,406 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:05,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-15 22:06:05,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735035027] [2019-11-15 22:06:05,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:06:05,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:05,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:06:05,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:06:05,409 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 12 states. [2019-11-15 22:06:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:06,307 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-11-15 22:06:06,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:06:06,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-15 22:06:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:06,309 INFO L225 Difference]: With dead ends: 98 [2019-11-15 22:06:06,309 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 22:06:06,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 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 22:06:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 22:06:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-11-15 22:06:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 22:06:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-11-15 22:06:06,317 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 31 [2019-11-15 22:06:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:06,317 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-11-15 22:06:06,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:06:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-11-15 22:06:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:06:06,318 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:06,319 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 22:06:06,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:06,524 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash 899872781, now seen corresponding path program 1 times [2019-11-15 22:06:06,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:06,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877075000] [2019-11-15 22:06:06,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:06,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:06,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:06,817 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 22:06:06,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877075000] [2019-11-15 22:06:06,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708409385] [2019-11-15 22:06:06,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:06,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 22:06:07,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:07,023 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 22:06:07,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:07,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:07,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:07,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 22:06:07,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:07,277 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 22:06:07,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:07,301 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-15 22:06:07,302 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 22:06:07,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-11-15 22:06:07,336 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 22:06:07,336 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:07,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 22:06:07,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411855529] [2019-11-15 22:06:07,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:06:07,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:07,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:06:07,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:06:07,339 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 16 states. [2019-11-15 22:06:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:08,664 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-11-15 22:06:08,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:06:08,665 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-15 22:06:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:08,666 INFO L225 Difference]: With dead ends: 98 [2019-11-15 22:06:08,666 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 22:06:08,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:06:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 22:06:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-15 22:06:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 22:06:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-11-15 22:06:08,673 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 31 [2019-11-15 22:06:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:08,674 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-11-15 22:06:08,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:06:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-11-15 22:06:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:06:08,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:08,676 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, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:08,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:08,882 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1688996133, now seen corresponding path program 1 times [2019-11-15 22:06:08,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:08,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343119004] [2019-11-15 22:06:08,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:08,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:08,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:06:09,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343119004] [2019-11-15 22:06:09,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:09,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:06:09,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781800264] [2019-11-15 22:06:09,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:06:09,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:09,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:06:09,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:06:09,056 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2019-11-15 22:06:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:09,387 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-11-15 22:06:09,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:06:09,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-15 22:06:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:09,389 INFO L225 Difference]: With dead ends: 99 [2019-11-15 22:06:09,389 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 22:06:09,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:06:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 22:06:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-15 22:06:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 22:06:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-11-15 22:06:09,395 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 37 [2019-11-15 22:06:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:09,395 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-11-15 22:06:09,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:06:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-11-15 22:06:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:06:09,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:09,397 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:09,397 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:09,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:09,398 INFO L82 PathProgramCache]: Analyzing trace with hash -372167865, now seen corresponding path program 1 times [2019-11-15 22:06:09,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:09,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716030375] [2019-11-15 22:06:09,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:09,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:09,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:10,150 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-11-15 22:06:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:10,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716030375] [2019-11-15 22:06:10,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094219933] [2019-11-15 22:06:10,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:10,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 22:06:10,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:10,532 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 22:06:10,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:10,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:10,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:10,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:06:10,549 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 22:06:10,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:10,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:10,556 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 22:06:10,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 22:06:10,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:06:10,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:06:10,795 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 22:06:10,795 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 22:06:10,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:10,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:10,809 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 22:06:10,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-11-15 22:06:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:10,949 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:10,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-11-15 22:06:10,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184046870] [2019-11-15 22:06:10,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 22:06:10,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:10,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 22:06:10,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:06:10,952 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 23 states. [2019-11-15 22:06:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:12,115 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-11-15 22:06:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:06:12,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-15 22:06:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:12,118 INFO L225 Difference]: With dead ends: 149 [2019-11-15 22:06:12,118 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 22:06:12,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:06:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 22:06:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 107. [2019-11-15 22:06:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 22:06:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2019-11-15 22:06:12,126 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 39 [2019-11-15 22:06:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:12,126 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2019-11-15 22:06:12,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 22:06:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2019-11-15 22:06:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:06:12,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:12,128 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:12,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:12,333 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash -372167864, now seen corresponding path program 1 times [2019-11-15 22:06:12,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:12,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185735069] [2019-11-15 22:06:12,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:12,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:12,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:13,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185735069] [2019-11-15 22:06:13,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74948608] [2019-11-15 22:06:13,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:13,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 22:06:13,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:13,213 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 22:06:13,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:13,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:13,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:13,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:06:13,239 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 22:06:13,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:13,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:13,246 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 22:06:13,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 22:06:13,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:06:13,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:06:13,465 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 22:06:13,465 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 22:06:13,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:13,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:13,482 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 22:06:13,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-11-15 22:06:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:13,625 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:13,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-15 22:06:13,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284962846] [2019-11-15 22:06:13,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 22:06:13,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 22:06:13,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:06:13,628 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 21 states. [2019-11-15 22:06:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:15,295 INFO L93 Difference]: Finished difference Result 163 states and 176 transitions. [2019-11-15 22:06:15,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:06:15,295 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-11-15 22:06:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:15,297 INFO L225 Difference]: With dead ends: 163 [2019-11-15 22:06:15,297 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:06:15,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:06:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:06:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 140. [2019-11-15 22:06:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-15 22:06:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2019-11-15 22:06:15,305 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 39 [2019-11-15 22:06:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:15,305 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2019-11-15 22:06:15,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 22:06:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2019-11-15 22:06:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:06:15,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:15,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:15,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:15,511 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1171031827, now seen corresponding path program 1 times [2019-11-15 22:06:15,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:15,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054785021] [2019-11-15 22:06:15,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:15,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:15,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:15,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054785021] [2019-11-15 22:06:15,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:15,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 22:06:15,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517834998] [2019-11-15 22:06:15,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:06:15,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:06:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:06:15,906 INFO L87 Difference]: Start difference. First operand 140 states and 172 transitions. Second operand 16 states. [2019-11-15 22:06:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:17,396 INFO L93 Difference]: Finished difference Result 290 states and 368 transitions. [2019-11-15 22:06:17,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:06:17,396 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-11-15 22:06:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:17,399 INFO L225 Difference]: With dead ends: 290 [2019-11-15 22:06:17,399 INFO L226 Difference]: Without dead ends: 290 [2019-11-15 22:06:17,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:06:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-15 22:06:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 195. [2019-11-15 22:06:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-15 22:06:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 272 transitions. [2019-11-15 22:06:17,410 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 272 transitions. Word has length 41 [2019-11-15 22:06:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:17,411 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 272 transitions. [2019-11-15 22:06:17,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:06:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 272 transitions. [2019-11-15 22:06:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:06:17,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:17,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:17,413 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1171031828, now seen corresponding path program 1 times [2019-11-15 22:06:17,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:17,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419777966] [2019-11-15 22:06:17,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:17,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:17,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:06:17,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419777966] [2019-11-15 22:06:17,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:17,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 22:06:17,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921875709] [2019-11-15 22:06:17,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:06:17,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:17,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:06:17,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:06:17,709 INFO L87 Difference]: Start difference. First operand 195 states and 272 transitions. Second operand 16 states. [2019-11-15 22:06:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:18,617 INFO L93 Difference]: Finished difference Result 251 states and 336 transitions. [2019-11-15 22:06:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:06:18,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-11-15 22:06:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:18,620 INFO L225 Difference]: With dead ends: 251 [2019-11-15 22:06:18,620 INFO L226 Difference]: Without dead ends: 251 [2019-11-15 22:06:18,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:06:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-15 22:06:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 193. [2019-11-15 22:06:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-15 22:06:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2019-11-15 22:06:18,632 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 41 [2019-11-15 22:06:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:18,632 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2019-11-15 22:06:18,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:06:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2019-11-15 22:06:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 22:06:18,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:18,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:18,634 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 133181419, now seen corresponding path program 1 times [2019-11-15 22:06:18,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:18,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035764836] [2019-11-15 22:06:18,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:18,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:18,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:19,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035764836] [2019-11-15 22:06:19,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557136476] [2019-11-15 22:06:19,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:19,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 104 conjunts are in the unsatisfiable core [2019-11-15 22:06:19,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:20,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:20,501 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 14 treesize of output 30 [2019-11-15 22:06:20,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:20,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:20,535 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-15 22:06:20,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:20,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 [2019-11-15 22:06:20,706 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 22:06:20,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:20,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:20,726 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 22:06:20,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:20,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:20,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:20,742 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-11-15 22:06:20,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:06:20,950 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:20,951 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 62 treesize of output 64 [2019-11-15 22:06:20,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:20,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:06:21,016 INFO L567 ElimStorePlain]: treesize reduction 46, result has 63.5 percent of original size [2019-11-15 22:06:21,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:21,051 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 68 treesize of output 82 [2019-11-15 22:06:21,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:06:21,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:21,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:21,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 22:06:21,130 INFO L567 ElimStorePlain]: treesize reduction 242, result has 22.9 percent of original size [2019-11-15 22:06:21,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:21,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:71 [2019-11-15 22:06:22,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:22,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:06:22,622 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:22,623 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 191 treesize of output 136 [2019-11-15 22:06:22,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:22,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:22,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:22,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:22,627 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 22:06:22,678 INFO L567 ElimStorePlain]: treesize reduction 28, result has 77.2 percent of original size [2019-11-15 22:06:22,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:22,689 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 44 [2019-11-15 22:06:22,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:22,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:22,701 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 22:06:22,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:205, output treesize:23 [2019-11-15 22:06:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:22,890 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:22,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 55 [2019-11-15 22:06:22,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95373746] [2019-11-15 22:06:22,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-11-15 22:06:22,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:22,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-11-15 22:06:22,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2933, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 22:06:22,893 INFO L87 Difference]: Start difference. First operand 193 states and 262 transitions. Second operand 56 states. [2019-11-15 22:06:24,837 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-11-15 22:06:25,481 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-11-15 22:06:25,742 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-11-15 22:06:26,013 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-11-15 22:06:26,300 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-11-15 22:06:26,613 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-11-15 22:06:27,006 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 92 [2019-11-15 22:06:27,443 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 99 [2019-11-15 22:06:27,795 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-11-15 22:06:28,549 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-11-15 22:06:29,982 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-11-15 22:06:31,082 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-11-15 22:06:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:31,722 INFO L93 Difference]: Finished difference Result 285 states and 349 transitions. [2019-11-15 22:06:31,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:06:31,722 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 46 [2019-11-15 22:06:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:31,725 INFO L225 Difference]: With dead ends: 285 [2019-11-15 22:06:31,725 INFO L226 Difference]: Without dead ends: 285 [2019-11-15 22:06:31,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=455, Invalid=6187, Unknown=0, NotChecked=0, Total=6642 [2019-11-15 22:06:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-15 22:06:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 198. [2019-11-15 22:06:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-15 22:06:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 269 transitions. [2019-11-15 22:06:31,742 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 269 transitions. Word has length 46 [2019-11-15 22:06:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:31,742 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 269 transitions. [2019-11-15 22:06:31,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-11-15 22:06:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 269 transitions. [2019-11-15 22:06:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 22:06:31,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:31,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:31,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:31,948 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash 133181418, now seen corresponding path program 1 times [2019-11-15 22:06:31,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:31,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345934566] [2019-11-15 22:06:31,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:31,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:31,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:32,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345934566] [2019-11-15 22:06:32,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263439586] [2019-11-15 22:06:32,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:32,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 99 conjunts are in the unsatisfiable core [2019-11-15 22:06:32,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:33,373 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:33,373 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 28 [2019-11-15 22:06:33,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:33,413 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-15 22:06:33,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:33,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2019-11-15 22:06:33,519 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 22:06:33,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:33,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:33,535 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 22:06:33,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:33,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:33,548 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 22:06:33,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2019-11-15 22:06:33,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:06:33,715 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:33,715 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 40 [2019-11-15 22:06:33,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:33,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:33,717 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 22:06:33,761 INFO L567 ElimStorePlain]: treesize reduction 12, result has 85.0 percent of original size [2019-11-15 22:06:33,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:33,787 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 41 treesize of output 55 [2019-11-15 22:06:33,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:33,788 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:06:33,855 INFO L567 ElimStorePlain]: treesize reduction 37, result has 63.7 percent of original size [2019-11-15 22:06:33,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:33,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:06:33,857 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:64 [2019-11-15 22:06:33,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:33,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:34,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:34,790 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 74 [2019-11-15 22:06:34,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:34,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:34,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:34,849 INFO L567 ElimStorePlain]: treesize reduction 50, result has 52.8 percent of original size [2019-11-15 22:06:34,850 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 22:06:34,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:113, output treesize:56 [2019-11-15 22:06:35,016 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:06:35,049 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:35,049 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 50 treesize of output 29 [2019-11-15 22:06:35,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:35,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:35,051 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 22:06:35,073 INFO L567 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2019-11-15 22:06:35,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:06:35,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2019-11-15 22:06:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:35,209 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:35,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 50 [2019-11-15 22:06:35,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044800810] [2019-11-15 22:06:35,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-11-15 22:06:35,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-11-15 22:06:35,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2406, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 22:06:35,212 INFO L87 Difference]: Start difference. First operand 198 states and 269 transitions. Second operand 51 states. [2019-11-15 22:06:36,424 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-11-15 22:06:37,310 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-11-15 22:06:37,539 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-11-15 22:06:37,773 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-11-15 22:06:40,130 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-15 22:06:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:40,508 INFO L93 Difference]: Finished difference Result 321 states and 409 transitions. [2019-11-15 22:06:40,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 22:06:40,509 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 46 [2019-11-15 22:06:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:40,511 INFO L225 Difference]: With dead ends: 321 [2019-11-15 22:06:40,511 INFO L226 Difference]: Without dead ends: 321 [2019-11-15 22:06:40,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=459, Invalid=5393, Unknown=0, NotChecked=0, Total=5852 [2019-11-15 22:06:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-15 22:06:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 200. [2019-11-15 22:06:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-15 22:06:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 271 transitions. [2019-11-15 22:06:40,522 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 271 transitions. Word has length 46 [2019-11-15 22:06:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:40,523 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 271 transitions. [2019-11-15 22:06:40,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-11-15 22:06:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 271 transitions. [2019-11-15 22:06:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:06:40,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:40,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:40,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:40,728 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash -167972392, now seen corresponding path program 1 times [2019-11-15 22:06:40,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:40,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912509998] [2019-11-15 22:06:40,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:40,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:40,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:40,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912509998] [2019-11-15 22:06:40,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:40,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 22:06:40,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753519959] [2019-11-15 22:06:40,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:06:40,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:40,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:06:40,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:06:40,987 INFO L87 Difference]: Start difference. First operand 200 states and 271 transitions. Second operand 15 states. [2019-11-15 22:06:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:41,993 INFO L93 Difference]: Finished difference Result 298 states and 396 transitions. [2019-11-15 22:06:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:06:41,994 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-11-15 22:06:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:41,996 INFO L225 Difference]: With dead ends: 298 [2019-11-15 22:06:41,997 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 22:06:41,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:06:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 22:06:42,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 248. [2019-11-15 22:06:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-15 22:06:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 346 transitions. [2019-11-15 22:06:42,009 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 346 transitions. Word has length 47 [2019-11-15 22:06:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:42,010 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 346 transitions. [2019-11-15 22:06:42,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:06:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 346 transitions. [2019-11-15 22:06:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:06:42,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:42,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:42,012 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:42,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -911745785, now seen corresponding path program 1 times [2019-11-15 22:06:42,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:42,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741191933] [2019-11-15 22:06:42,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:42,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:42,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:06:42,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741191933] [2019-11-15 22:06:42,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:42,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:06:42,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694081167] [2019-11-15 22:06:42,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:06:42,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:42,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:06:42,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:06:42,137 INFO L87 Difference]: Start difference. First operand 248 states and 346 transitions. Second operand 7 states. [2019-11-15 22:06:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:42,669 INFO L93 Difference]: Finished difference Result 300 states and 416 transitions. [2019-11-15 22:06:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:06:42,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-11-15 22:06:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:42,673 INFO L225 Difference]: With dead ends: 300 [2019-11-15 22:06:42,673 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 22:06:42,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:06:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 22:06:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 256. [2019-11-15 22:06:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-15 22:06:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 358 transitions. [2019-11-15 22:06:42,686 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 358 transitions. Word has length 48 [2019-11-15 22:06:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:42,686 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 358 transitions. [2019-11-15 22:06:42,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:06:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 358 transitions. [2019-11-15 22:06:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:06:42,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:42,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:42,688 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash -912176734, now seen corresponding path program 1 times [2019-11-15 22:06:42,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:42,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696377449] [2019-11-15 22:06:42,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:42,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:42,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:42,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696377449] [2019-11-15 22:06:42,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:42,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 22:06:42,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659645489] [2019-11-15 22:06:42,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:06:42,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:42,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:06:42,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:06:42,945 INFO L87 Difference]: Start difference. First operand 256 states and 358 transitions. Second operand 15 states. [2019-11-15 22:06:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:44,021 INFO L93 Difference]: Finished difference Result 324 states and 442 transitions. [2019-11-15 22:06:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:06:44,022 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-11-15 22:06:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:44,024 INFO L225 Difference]: With dead ends: 324 [2019-11-15 22:06:44,025 INFO L226 Difference]: Without dead ends: 324 [2019-11-15 22:06:44,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:06:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-15 22:06:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 276. [2019-11-15 22:06:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-15 22:06:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 389 transitions. [2019-11-15 22:06:44,038 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 389 transitions. Word has length 48 [2019-11-15 22:06:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:44,039 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 389 transitions. [2019-11-15 22:06:44,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:06:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 389 transitions. [2019-11-15 22:06:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:06:44,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:44,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:44,041 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:44,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:44,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1787292442, now seen corresponding path program 1 times [2019-11-15 22:06:44,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:44,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495231876] [2019-11-15 22:06:44,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:44,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:44,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:06:44,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495231876] [2019-11-15 22:06:44,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:44,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:06:44,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026445316] [2019-11-15 22:06:44,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:06:44,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:06:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:06:44,180 INFO L87 Difference]: Start difference. First operand 276 states and 389 transitions. Second operand 9 states. [2019-11-15 22:06:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:44,797 INFO L93 Difference]: Finished difference Result 318 states and 435 transitions. [2019-11-15 22:06:44,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:06:44,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-11-15 22:06:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:44,800 INFO L225 Difference]: With dead ends: 318 [2019-11-15 22:06:44,800 INFO L226 Difference]: Without dead ends: 318 [2019-11-15 22:06:44,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:06:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-15 22:06:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 275. [2019-11-15 22:06:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-15 22:06:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 383 transitions. [2019-11-15 22:06:44,812 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 383 transitions. Word has length 49 [2019-11-15 22:06:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:44,813 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 383 transitions. [2019-11-15 22:06:44,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:06:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 383 transitions. [2019-11-15 22:06:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:06:44,814 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:44,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:44,815 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash -428509019, now seen corresponding path program 1 times [2019-11-15 22:06:44,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:44,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804620548] [2019-11-15 22:06:44,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:44,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:44,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:45,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804620548] [2019-11-15 22:06:45,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034739033] [2019-11-15 22:06:45,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:45,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:06:45,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:45,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:06:45,844 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 22:06:45,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:45,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:45,850 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 22:06:45,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-11-15 22:06:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:06:45,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:06:45,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27 [2019-11-15 22:06:45,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12367912] [2019-11-15 22:06:45,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:06:45,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:45,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:06:45,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:06:45,888 INFO L87 Difference]: Start difference. First operand 275 states and 383 transitions. Second operand 8 states. [2019-11-15 22:06:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:46,131 INFO L93 Difference]: Finished difference Result 274 states and 377 transitions. [2019-11-15 22:06:46,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:06:46,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-15 22:06:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:46,133 INFO L225 Difference]: With dead ends: 274 [2019-11-15 22:06:46,133 INFO L226 Difference]: Without dead ends: 274 [2019-11-15 22:06:46,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:06:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-15 22:06:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-11-15 22:06:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-15 22:06:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 377 transitions. [2019-11-15 22:06:46,140 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 377 transitions. Word has length 50 [2019-11-15 22:06:46,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:46,141 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 377 transitions. [2019-11-15 22:06:46,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:06:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 377 transitions. [2019-11-15 22:06:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 22:06:46,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:46,141 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:46,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:46,342 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1809147371, now seen corresponding path program 2 times [2019-11-15 22:06:46,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:46,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190352032] [2019-11-15 22:06:46,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:46,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:46,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 22:06:46,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190352032] [2019-11-15 22:06:46,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626871678] [2019-11-15 22:06:46,462 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:46,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:06:46,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:06:46,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:06:46,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 22:06:46,665 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:46,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 22:06:46,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389844824] [2019-11-15 22:06:46,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:06:46,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:46,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:06:46,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:06:46,667 INFO L87 Difference]: Start difference. First operand 274 states and 377 transitions. Second operand 9 states. [2019-11-15 22:06:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:46,999 INFO L93 Difference]: Finished difference Result 170 states and 210 transitions. [2019-11-15 22:06:47,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:06:47,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-15 22:06:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:47,001 INFO L225 Difference]: With dead ends: 170 [2019-11-15 22:06:47,001 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 22:06:47,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:06:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 22:06:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-11-15 22:06:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 22:06:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2019-11-15 22:06:47,008 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 51 [2019-11-15 22:06:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:47,008 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2019-11-15 22:06:47,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:06:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2019-11-15 22:06:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 22:06:47,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:47,009 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:47,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:47,210 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash 858007469, now seen corresponding path program 2 times [2019-11-15 22:06:47,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:47,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069300058] [2019-11-15 22:06:47,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:47,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:47,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:48,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069300058] [2019-11-15 22:06:48,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895160229] [2019-11-15 22:06:48,079 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:48,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:06:48,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:06:48,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-15 22:06:48,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:48,465 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:48,465 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 22:06:48,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:48,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:48,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:48,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 22:06:48,573 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 22:06:48,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:48,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:48,593 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 22:06:48,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:48,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:48,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:48,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-11-15 22:06:48,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:48,732 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 55 treesize of output 73 [2019-11-15 22:06:48,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:48,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:48,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:48,771 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 39 treesize of output 33 [2019-11-15 22:06:48,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:48,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:48,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:48,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:45 [2019-11-15 22:06:49,691 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:06:49,715 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:49,716 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 160 treesize of output 101 [2019-11-15 22:06:49,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:49,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:49,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:49,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:49,719 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 22:06:49,764 INFO L567 ElimStorePlain]: treesize reduction 28, result has 70.5 percent of original size [2019-11-15 22:06:49,778 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:49,779 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 34 [2019-11-15 22:06:49,780 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 22:06:49,801 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-11-15 22:06:49,802 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 22:06:49,802 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:181, output treesize:13 [2019-11-15 22:06:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:06:49,873 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:06:49,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2019-11-15 22:06:49,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243168748] [2019-11-15 22:06:49,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-15 22:06:49,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:49,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-15 22:06:49,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2032, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 22:06:49,876 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand 47 states. [2019-11-15 22:06:52,066 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-15 22:06:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:53,375 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2019-11-15 22:06:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 22:06:53,377 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 51 [2019-11-15 22:06:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:53,378 INFO L225 Difference]: With dead ends: 163 [2019-11-15 22:06:53,378 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:06:53,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=321, Invalid=3711, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 22:06:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:06:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2019-11-15 22:06:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 22:06:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2019-11-15 22:06:53,385 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 51 [2019-11-15 22:06:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:53,385 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2019-11-15 22:06:53,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-15 22:06:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2019-11-15 22:06:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:06:53,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:53,386 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:53,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:06:53,587 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash -138613687, now seen corresponding path program 1 times [2019-11-15 22:06:53,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:53,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303754361] [2019-11-15 22:06:53,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:53,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:53,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:06:53,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303754361] [2019-11-15 22:06:53,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:53,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 22:06:53,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803615287] [2019-11-15 22:06:53,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:06:53,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:06:53,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:06:53,890 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand 16 states. [2019-11-15 22:06:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:54,761 INFO L93 Difference]: Finished difference Result 155 states and 180 transitions. [2019-11-15 22:06:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:06:54,762 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-15 22:06:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:54,763 INFO L225 Difference]: With dead ends: 155 [2019-11-15 22:06:54,763 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 22:06:54,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:06:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 22:06:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2019-11-15 22:06:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 22:06:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2019-11-15 22:06:54,768 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 53 [2019-11-15 22:06:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:54,768 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2019-11-15 22:06:54,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:06:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2019-11-15 22:06:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:06:54,769 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:54,769 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:54,770 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash -138613686, now seen corresponding path program 1 times [2019-11-15 22:06:54,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:54,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613648288] [2019-11-15 22:06:54,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:54,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:54,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:06:55,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613648288] [2019-11-15 22:06:55,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:55,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 22:06:55,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312089949] [2019-11-15 22:06:55,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:06:55,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:55,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:06:55,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:06:55,172 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand 16 states. [2019-11-15 22:06:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:56,425 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2019-11-15 22:06:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:06:56,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-15 22:06:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:56,426 INFO L225 Difference]: With dead ends: 171 [2019-11-15 22:06:56,427 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 22:06:56,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:06:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 22:06:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2019-11-15 22:06:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-15 22:06:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2019-11-15 22:06:56,432 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 190 transitions. Word has length 53 [2019-11-15 22:06:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:56,432 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 190 transitions. [2019-11-15 22:06:56,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:06:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2019-11-15 22:06:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 22:06:56,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:56,433 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, 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 22:06:56,434 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1075147449, now seen corresponding path program 1 times [2019-11-15 22:06:56,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:56,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874059014] [2019-11-15 22:06:56,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:56,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:56,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:06:56,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874059014] [2019-11-15 22:06:56,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:06:56,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:06:56,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394118128] [2019-11-15 22:06:56,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:06:56,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:06:56,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:06:56,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:06:56,571 INFO L87 Difference]: Start difference. First operand 157 states and 190 transitions. Second operand 8 states. [2019-11-15 22:06:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:06:56,936 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2019-11-15 22:06:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:06:56,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-11-15 22:06:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:06:56,937 INFO L225 Difference]: With dead ends: 155 [2019-11-15 22:06:56,937 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 22:06:56,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:06:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 22:06:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-15 22:06:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 22:06:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 187 transitions. [2019-11-15 22:06:56,942 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 187 transitions. Word has length 55 [2019-11-15 22:06:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:06:56,943 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 187 transitions. [2019-11-15 22:06:56,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:06:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 187 transitions. [2019-11-15 22:06:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:06:56,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:06:56,944 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:06:56,944 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:06:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:06:56,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1976695190, now seen corresponding path program 1 times [2019-11-15 22:06:56,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:06:56,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353584249] [2019-11-15 22:06:56,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:56,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:06:56,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:06:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:06:57,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353584249] [2019-11-15 22:06:57,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599913737] [2019-11-15 22:06:57,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:06:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:06:57,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 95 conjunts are in the unsatisfiable core [2019-11-15 22:06:57,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:06:58,178 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 22:06:58,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:58,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:58,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:06:58,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-15 22:06:58,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:06:58,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:58,301 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-15 22:06:58,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:58,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:06:58,329 INFO L567 ElimStorePlain]: treesize reduction 12, result has 73.3 percent of original size [2019-11-15 22:06:58,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:58,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:06:58,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:33 [2019-11-15 22:06:58,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:58,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:59,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:59,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:59,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:59,827 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 89 treesize of output 68 [2019-11-15 22:06:59,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:59,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:59,830 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 22:06:59,953 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-15 22:06:59,953 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.6 percent of original size [2019-11-15 22:06:59,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:06:59,968 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 85 treesize of output 72 [2019-11-15 22:06:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:59,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:06:59,970 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 22:07:00,074 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-11-15 22:07:00,074 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.8 percent of original size [2019-11-15 22:07:00,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 22:07:00,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:105 [2019-11-15 22:07:00,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:00,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:00,595 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[v_prenex_4]} [2019-11-15 22:07:00,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:07:00,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:00,606 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 57 treesize of output 36 [2019-11-15 22:07:00,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:00,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:00,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:00,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:07:00,681 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:07:00,695 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-15 22:07:00,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 47 [2019-11-15 22:07:00,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:00,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:00,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:07:00,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:119, output treesize:44 [2019-11-15 22:07:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:07:00,966 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:00,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 53 [2019-11-15 22:07:00,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789546721] [2019-11-15 22:07:00,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-11-15 22:07:00,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-11-15 22:07:00,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2731, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 22:07:00,969 INFO L87 Difference]: Start difference. First operand 155 states and 187 transitions. Second operand 54 states. [2019-11-15 22:07:02,917 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-11-15 22:07:03,120 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-11-15 22:07:03,338 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-11-15 22:07:03,620 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-11-15 22:07:03,870 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-11-15 22:07:04,113 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-11-15 22:07:04,392 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-11-15 22:07:04,815 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-11-15 22:07:05,123 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-11-15 22:07:05,489 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-11-15 22:07:06,348 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-11-15 22:07:06,837 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-11-15 22:07:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:07,801 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2019-11-15 22:07:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 22:07:07,802 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 56 [2019-11-15 22:07:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:07,803 INFO L225 Difference]: With dead ends: 166 [2019-11-15 22:07:07,803 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 22:07:07,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=436, Invalid=6370, Unknown=0, NotChecked=0, Total=6806 [2019-11-15 22:07:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 22:07:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2019-11-15 22:07:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 22:07:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2019-11-15 22:07:07,811 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 56 [2019-11-15 22:07:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:07,811 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2019-11-15 22:07:07,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-11-15 22:07:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2019-11-15 22:07:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:07:07,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:07,812 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, 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 22:07:08,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:08,013 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:07:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1870420457, now seen corresponding path program 1 times [2019-11-15 22:07:08,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:08,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135542878] [2019-11-15 22:07:08,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:07:08,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135542878] [2019-11-15 22:07:08,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436726754] [2019-11-15 22:07:08,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:08,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:07:08,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:07:08,370 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:08,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-15 22:07:08,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160402392] [2019-11-15 22:07:08,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:07:08,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:08,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:07:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:07:08,371 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 10 states. [2019-11-15 22:07:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:08,596 INFO L93 Difference]: Finished difference Result 163 states and 197 transitions. [2019-11-15 22:07:08,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:07:08,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-15 22:07:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:08,598 INFO L225 Difference]: With dead ends: 163 [2019-11-15 22:07:08,598 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:07:08,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:07:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:07:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-11-15 22:07:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-15 22:07:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2019-11-15 22:07:08,603 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 57 [2019-11-15 22:07:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:08,603 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2019-11-15 22:07:08,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:07:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2019-11-15 22:07:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:07:08,604 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:08,604 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:08,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:08,810 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:07:08,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1147956929, now seen corresponding path program 1 times [2019-11-15 22:07:08,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:08,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211969716] [2019-11-15 22:07:08,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:07:09,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211969716] [2019-11-15 22:07:09,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258977333] [2019-11-15 22:07:09,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:09,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 22:07:09,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:09,313 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 25 treesize of output 17 [2019-11-15 22:07:09,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:09,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:09,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:09,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-15 22:07:09,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:09,377 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 25 treesize of output 24 [2019-11-15 22:07:09,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:09,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:09,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:09,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-11-15 22:07:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:07:09,385 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:09,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 16 [2019-11-15 22:07:09,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344588823] [2019-11-15 22:07:09,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:07:09,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:09,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:07:09,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:07:09,386 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand 17 states. [2019-11-15 22:07:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:10,842 INFO L93 Difference]: Finished difference Result 261 states and 303 transitions. [2019-11-15 22:07:10,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:07:10,842 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-11-15 22:07:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:07:10,843 INFO L225 Difference]: With dead ends: 261 [2019-11-15 22:07:10,844 INFO L226 Difference]: Without dead ends: 261 [2019-11-15 22:07:10,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:07:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-15 22:07:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 166. [2019-11-15 22:07:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 22:07:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 202 transitions. [2019-11-15 22:07:10,850 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 202 transitions. Word has length 57 [2019-11-15 22:07:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:07:10,850 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 202 transitions. [2019-11-15 22:07:10,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:07:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 202 transitions. [2019-11-15 22:07:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:07:10,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:10,852 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:11,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:11,055 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 22:07:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:11,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1147956928, now seen corresponding path program 1 times [2019-11-15 22:07:11,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:11,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141572775] [2019-11-15 22:07:11,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:11,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:11,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 22:07:11,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141572775] [2019-11-15 22:07:11,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930558735] [2019-11-15 22:07:11,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:11,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:07:11,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:11,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:11,496 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 61 treesize of output 48 [2019-11-15 22:07:11,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:11,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:11,497 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 22:07:11,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:11,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:07:11,710 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 22:07:11,713 INFO L168 Benchmark]: Toolchain (without parser) took 72896.00 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 724.6 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -276.0 MB). Peak memory consumption was 448.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:11,714 INFO L168 Benchmark]: CDTParser took 0.30 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 22:07:11,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:11,714 INFO L168 Benchmark]: Boogie Preprocessor took 79.60 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 22:07:11,715 INFO L168 Benchmark]: RCFGBuilder took 839.60 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: 68.2 MB). Peak memory consumption was 68.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:11,715 INFO L168 Benchmark]: TraceAbstraction took 71237.83 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 574.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -163.3 MB). Peak memory consumption was 410.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:11,717 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 734.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.60 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 839.60 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: 68.2 MB). Peak memory consumption was 68.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71237.83 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 574.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -163.3 MB). Peak memory consumption was 410.8 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 22:07:14,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:07:14,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:07:14,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:07:14,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:07:14,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:07:14,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:07:14,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:07:14,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:07:14,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:07:14,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:07:14,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:07:14,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:07:14,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:07:14,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:07:14,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:07:14,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:07:14,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:07:14,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:07:14,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:07:14,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:07:14,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:07:14,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:07:14,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:07:14,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:07:14,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:07:14,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:07:14,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:07:14,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:07:14,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:07:14,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:07:14,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:07:14,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:07:14,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:07:14,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:07:14,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:07:14,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:07:14,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:07:14,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:07:14,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:07:14,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:07:14,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 22:07:14,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:07:14,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:07:14,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:07:14,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:07:14,326 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:07:14,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:07:14,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:07:14,327 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:07:14,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:07:14,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:07:14,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:07:14,328 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:07:14,328 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:07:14,329 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:07:14,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:07:14,329 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:07:14,329 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:07:14,330 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:07:14,330 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:07:14,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:07:14,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:07:14,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:07:14,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:07:14,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:07:14,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:07:14,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:07:14,332 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:07:14,333 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:07:14,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:07:14,333 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_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 -> 8e9bd4c45107b8bac8caf02aded500b0232909d1 [2019-11-15 22:07:14,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:07:14,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:07:14,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:07:14,398 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:07:14,398 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:07:14,399 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2019-11-15 22:07:14,458 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data/b65a5beb0/b931245f0281432e92acd3d283e9d042/FLAGa96f8b2e4 [2019-11-15 22:07:15,041 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:07:15,042 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2019-11-15 22:07:15,058 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data/b65a5beb0/b931245f0281432e92acd3d283e9d042/FLAGa96f8b2e4 [2019-11-15 22:07:15,331 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/bin/uautomizer/data/b65a5beb0/b931245f0281432e92acd3d283e9d042 [2019-11-15 22:07:15,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:07:15,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:07:15,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:07:15,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:07:15,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:07:15,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:07:15" (1/1) ... [2019-11-15 22:07:15,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad2bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15, skipping insertion in model container [2019-11-15 22:07:15,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:07:15" (1/1) ... [2019-11-15 22:07:15,351 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:07:15,407 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:07:15,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:07:15,794 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:07:15,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:07:15,952 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:07:15,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15 WrapperNode [2019-11-15 22:07:15,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:07:15,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:07:15,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:07:15,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:07:15,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15" (1/1) ... [2019-11-15 22:07:15,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15" (1/1) ... [2019-11-15 22:07:15,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15" (1/1) ... [2019-11-15 22:07:15,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15" (1/1) ... [2019-11-15 22:07:16,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15" (1/1) ... [2019-11-15 22:07:16,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15" (1/1) ... [2019-11-15 22:07:16,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15" (1/1) ... [2019-11-15 22:07:16,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:07:16,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:07:16,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:07:16,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:07:16,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:07:16,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:07:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:07:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:07:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:07:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 22:07:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 22:07:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-15 22:07:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_last [2019-11-15 22:07:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:07:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:07:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:07:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:07:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:07:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:07:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:07:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:07:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:07:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:07:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:07:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:07:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:07:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:07:16,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:07:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:07:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:07:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:07:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:07:16,103 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:07:16,103 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:07:16,103 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:07:16,103 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:07:16,103 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:07:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:07:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:07:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:07:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:07:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:07:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:07:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:07:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:07:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:07:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:07:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:07:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:07:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:07:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:07:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:07:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:07:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:07:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:07:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:07:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:07:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:07:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:07:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:07:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:07:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:07:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:07:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:07:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:07:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:07:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:07:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:07:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:07:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:07:16,114 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:07:16,115 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:07:16,115 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:07:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:07:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:07:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:07:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:07:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:07:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:07:16,124 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:07:16,124 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:07:16,124 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:07:16,124 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:07:16,125 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:07:16,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:07:16,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:07:16,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:07:16,125 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:07:16,126 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:07:16,126 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:07:16,126 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:07:16,126 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:07:16,126 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:07:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:07:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:07:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:07:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:07:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:07:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:07:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:07:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:07:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:07:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:07:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:07:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:07:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:07:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:07:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:07:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:07:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:07:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:07:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:07:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:07:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:07:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:07:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 22:07:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 22:07:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:07:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:07:16,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:07:16,133 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-15 22:07:16,133 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_last [2019-11-15 22:07:16,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:07:16,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:07:16,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:07:16,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:07:16,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 22:07:16,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:07:16,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:07:16,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:07:16,595 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 22:07:17,136 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:07:17,137 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 22:07:17,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:07:17 BoogieIcfgContainer [2019-11-15 22:07:17,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:07:17,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:07:17,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:07:17,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:07:17,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:07:15" (1/3) ... [2019-11-15 22:07:17,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a157b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:07:17, skipping insertion in model container [2019-11-15 22:07:17,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:15" (2/3) ... [2019-11-15 22:07:17,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a157b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:07:17, skipping insertion in model container [2019-11-15 22:07:17,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:07:17" (3/3) ... [2019-11-15 22:07:17,158 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2019-11-15 22:07:17,170 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:07:17,180 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-11-15 22:07:17,192 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-11-15 22:07:17,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:07:17,212 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:07:17,212 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:07:17,213 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:07:17,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:07:17,213 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:07:17,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:07:17,214 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:07:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-15 22:07:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:07:17,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:07:17,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:17,252 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_remove_lastErr18REQUIRES_VIOLATION, sll_circular_remove_lastErr19REQUIRES_VIOLATION, sll_circular_remove_lastErr17REQUIRES_VIOLATION, sll_circular_remove_lastErr21REQUIRES_VIOLATION, sll_circular_remove_lastErr0REQUIRES_VIOLATION, sll_circular_remove_lastErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr20REQUIRES_VIOLATION, sll_circular_remove_lastErr16REQUIRES_VIOLATION, sll_circular_remove_lastErr13ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr15REQUIRES_VIOLATION, sll_circular_remove_lastErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr8REQUIRES_VIOLATION, sll_circular_remove_lastErr29REQUIRES_VIOLATION, sll_circular_remove_lastErr28REQUIRES_VIOLATION, sll_circular_remove_lastErr6REQUIRES_VIOLATION, sll_circular_remove_lastErr7REQUIRES_VIOLATION, sll_circular_remove_lastErr10REQUIRES_VIOLATION, sll_circular_remove_lastErr23ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr11REQUIRES_VIOLATION, sll_circular_remove_lastErr9REQUIRES_VIOLATION, sll_circular_remove_lastErr14ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_lastErr2REQUIRES_VIOLATION, sll_circular_remove_lastErr3REQUIRES_VIOLATION, sll_circular_remove_lastErr1REQUIRES_VIOLATION, sll_circular_remove_lastErr22REQUIRES_VIOLATION, sll_circular_remove_lastErr5REQUIRES_VIOLATION, sll_circular_remove_lastErr27REQUIRES_VIOLATION, sll_circular_remove_lastErr26REQUIRES_VIOLATION, sll_circular_remove_lastErr4REQUIRES_VIOLATION, sll_circular_remove_lastErr12ASSERT_VIOLATIONMEMORY_FREE, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:07:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1614276735, now seen corresponding path program 1 times [2019-11-15 22:07:17,270 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:07:17,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1832147072] [2019-11-15 22:07:17,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74d14642-fbf0-4d76-8fc4-d1ebeff62214/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 22:07:17,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:07:17,492 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 22:07:17,497 INFO L168 Benchmark]: Toolchain (without parser) took 2161.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -57.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:17,498 INFO L168 Benchmark]: CDTParser took 0.36 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 22:07:17,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:17,499 INFO L168 Benchmark]: Boogie Preprocessor took 76.61 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 22:07:17,500 INFO L168 Benchmark]: RCFGBuilder took 1106.68 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: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:17,501 INFO L168 Benchmark]: TraceAbstraction took 355.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:17,504 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.36 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 618.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.61 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 1106.68 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: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 355.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 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...