./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.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_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 ef034042979fe1e524a3655a8992190a25335ff0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 ef034042979fe1e524a3655a8992190a25335ff0 ..................................................................................................................................................................................................................................................................................................................................................................... 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 21:14:33,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:14:33,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:14:33,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:14:33,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:14:33,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:14:33,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:14:33,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:14:33,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:14:33,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:14:33,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:14:33,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:14:33,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:14:33,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:14:33,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:14:33,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:14:33,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:14:33,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:14:33,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:14:33,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:14:33,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:14:33,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:14:33,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:14:33,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:14:33,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:14:33,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:14:33,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:14:33,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:14:33,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:14:33,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:14:33,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:14:33,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:14:33,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:14:33,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:14:33,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:14:33,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:14:33,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:14:33,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:14:33,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:14:33,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:14:33,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:14:33,645 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:14:33,659 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:14:33,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:14:33,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:14:33,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:14:33,661 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:14:33,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:14:33,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:14:33,662 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:14:33,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:14:33,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:14:33,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:14:33,663 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:14:33,663 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:14:33,663 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:14:33,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:14:33,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:14:33,664 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:14:33,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:14:33,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:14:33,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:14:33,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:14:33,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:14:33,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:14:33,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:14:33,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:14:33,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:14:33,666 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_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 -> ef034042979fe1e524a3655a8992190a25335ff0 [2019-11-15 21:14:33,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:14:33,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:14:33,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:14:33,715 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:14:33,715 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:14:33,716 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-11-15 21:14:33,771 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data/688f1153c/c6789abede3147998f9b50725bfa1752/FLAG3c3996bf5 [2019-11-15 21:14:34,152 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:14:34,152 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-11-15 21:14:34,169 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data/688f1153c/c6789abede3147998f9b50725bfa1752/FLAG3c3996bf5 [2019-11-15 21:14:34,498 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data/688f1153c/c6789abede3147998f9b50725bfa1752 [2019-11-15 21:14:34,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:14:34,503 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:14:34,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:34,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:14:34,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:14:34,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:34" (1/1) ... [2019-11-15 21:14:34,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abc0313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:34, skipping insertion in model container [2019-11-15 21:14:34,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:34" (1/1) ... [2019-11-15 21:14:34,524 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:14:34,587 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:14:35,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:35,025 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:14:35,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:35,126 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:14:35,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35 WrapperNode [2019-11-15 21:14:35,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:35,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:14:35,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:14:35,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:14:35,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... [2019-11-15 21:14:35,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:14:35,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:14:35,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:14:35,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:14:35,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:14:35,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:14:35,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:14:35,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:14:35,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:14:35,280 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:14:35,280 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 21:14:35,281 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-15 21:14:35,281 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-11-15 21:14:35,281 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2019-11-15 21:14:35,282 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2019-11-15 21:14:35,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:14:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:14:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:14:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:14:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:14:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:14:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:14:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:14:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:14:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:14:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:14:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:14:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:14:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:14:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:14:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:14:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:14:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:14:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:14:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:14:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:14:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:14:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:14:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:14:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:14:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:14:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:14:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:14:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:14:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:14:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:14:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:14:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:14:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:14:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:14:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:14:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:14:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:14:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:14:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:14:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:14:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:14:35,292 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:14:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:14:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:14:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:14:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:14:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:14:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:14:35,293 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:14:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:14:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:14:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:14:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:14:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:14:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:14:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:14:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:14:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:14:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:14:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:14:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:14:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:14:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:14:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:14:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:14:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:14:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:14:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:14:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:14:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:14:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:14:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:14:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:14:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:14:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:14:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:14:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:14:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:14:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:14:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:14:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:14:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:14:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:14:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:14:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:14:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:14:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:14:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:14:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:14:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:14:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:14:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:14:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:14:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:14:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:14:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:14:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:14:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:14:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:14:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:14:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:14:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:14:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:14:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:14:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:14:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:14:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:14:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 21:14:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:14:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:14:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:14:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-15 21:14:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-11-15 21:14:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:14:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:14:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2019-11-15 21:14:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:14:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2019-11-15 21:14:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:14:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:14:35,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:14:35,683 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:14:35,869 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:14:35,870 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 21:14:35,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:35 BoogieIcfgContainer [2019-11-15 21:14:35,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:14:35,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:14:35,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:14:35,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:14:35,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:14:34" (1/3) ... [2019-11-15 21:14:35,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b85052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:14:35, skipping insertion in model container [2019-11-15 21:14:35,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:35" (2/3) ... [2019-11-15 21:14:35,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b85052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:14:35, skipping insertion in model container [2019-11-15 21:14:35,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:35" (3/3) ... [2019-11-15 21:14:35,886 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2019-11-15 21:14:35,897 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:14:35,909 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-15 21:14:35,920 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-15 21:14:35,943 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:14:35,943 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:14:35,943 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:14:35,944 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:14:35,944 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:14:35,944 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:14:35,944 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:14:35,944 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:14:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-11-15 21:14:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:14:35,979 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:35,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:35,981 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 360562924, now seen corresponding path program 1 times [2019-11-15 21:14:35,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:35,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043743637] [2019-11-15 21:14:35,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:35,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:35,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:36,246 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 21:14:36,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043743637] [2019-11-15 21:14:36,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:36,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:36,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346316123] [2019-11-15 21:14:36,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:36,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:36,268 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2019-11-15 21:14:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:36,659 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2019-11-15 21:14:36,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:36,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-15 21:14:36,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:36,672 INFO L225 Difference]: With dead ends: 118 [2019-11-15 21:14:36,672 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 21:14:36,674 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 21:14:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 21:14:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-11-15 21:14:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 21:14:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-15 21:14:36,753 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 13 [2019-11-15 21:14:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:36,754 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-15 21:14:36,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-15 21:14:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:14:36,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:36,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:36,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash 360562925, now seen corresponding path program 1 times [2019-11-15 21:14:36,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:36,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056079620] [2019-11-15 21:14:36,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:36,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:36,877 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 21:14:36,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056079620] [2019-11-15 21:14:36,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:36,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:36,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245958952] [2019-11-15 21:14:36,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:36,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:36,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:36,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:36,881 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 4 states. [2019-11-15 21:14:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:37,145 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2019-11-15 21:14:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:37,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-15 21:14:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:37,147 INFO L225 Difference]: With dead ends: 106 [2019-11-15 21:14:37,148 INFO L226 Difference]: Without dead ends: 106 [2019-11-15 21:14:37,149 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 21:14:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-15 21:14:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2019-11-15 21:14:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-15 21:14:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-11-15 21:14:37,167 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 13 [2019-11-15 21:14:37,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:37,168 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-11-15 21:14:37,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-11-15 21:14:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 21:14:37,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:37,170 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:37,170 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:37,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:37,171 INFO L82 PathProgramCache]: Analyzing trace with hash -611679416, now seen corresponding path program 1 times [2019-11-15 21:14:37,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:37,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823838476] [2019-11-15 21:14:37,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:37,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:37,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:37,304 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 21:14:37,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823838476] [2019-11-15 21:14:37,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:37,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:14:37,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954087196] [2019-11-15 21:14:37,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:14:37,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:37,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:14:37,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:14:37,307 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 7 states. [2019-11-15 21:14:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:37,772 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-11-15 21:14:37,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:14:37,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-15 21:14:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:37,774 INFO L225 Difference]: With dead ends: 101 [2019-11-15 21:14:37,774 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 21:14:37,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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 21:14:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 21:14:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2019-11-15 21:14:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-15 21:14:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-15 21:14:37,783 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 18 [2019-11-15 21:14:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:37,783 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-15 21:14:37,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:14:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-15 21:14:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:14:37,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:37,784 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 21:14:37,785 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902948, now seen corresponding path program 1 times [2019-11-15 21:14:37,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:37,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783688213] [2019-11-15 21:14:37,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:37,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:37,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:37,928 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 21:14:37,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783688213] [2019-11-15 21:14:37,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:37,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:14:37,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336274711] [2019-11-15 21:14:37,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:14:37,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:37,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:14:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:14:37,930 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 8 states. [2019-11-15 21:14:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:38,341 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-11-15 21:14:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:38,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 21:14:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:38,343 INFO L225 Difference]: With dead ends: 91 [2019-11-15 21:14:38,343 INFO L226 Difference]: Without dead ends: 91 [2019-11-15 21:14:38,343 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 21:14:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-15 21:14:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2019-11-15 21:14:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 21:14:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-11-15 21:14:38,352 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 19 [2019-11-15 21:14:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:38,353 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-11-15 21:14:38,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:14:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-11-15 21:14:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:14:38,354 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:38,354 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 21:14:38,355 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902949, now seen corresponding path program 1 times [2019-11-15 21:14:38,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:38,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373521003] [2019-11-15 21:14:38,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:38,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:38,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:38,599 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 21:14:38,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373521003] [2019-11-15 21:14:38,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:38,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:14:38,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659729260] [2019-11-15 21:14:38,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:14:38,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:38,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:14:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:14:38,604 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 9 states. [2019-11-15 21:14:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:38,889 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2019-11-15 21:14:38,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:38,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-15 21:14:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:38,891 INFO L225 Difference]: With dead ends: 90 [2019-11-15 21:14:38,891 INFO L226 Difference]: Without dead ends: 90 [2019-11-15 21:14:38,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:14:38,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-15 21:14:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2019-11-15 21:14:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-15 21:14:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-11-15 21:14:38,897 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2019-11-15 21:14:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:38,897 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-11-15 21:14:38,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:14:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-11-15 21:14:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:14:38,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:38,899 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:38,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash -343567322, now seen corresponding path program 1 times [2019-11-15 21:14:38,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:38,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682596173] [2019-11-15 21:14:38,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:38,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:38,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:39,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682596173] [2019-11-15 21:14:39,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:39,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 21:14:39,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738034284] [2019-11-15 21:14:39,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:14:39,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:14:39,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:14:39,143 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 14 states. [2019-11-15 21:14:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:39,873 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2019-11-15 21:14:39,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:14:39,874 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-15 21:14:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:39,875 INFO L225 Difference]: With dead ends: 98 [2019-11-15 21:14:39,875 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 21:14:39,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:14:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 21:14:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2019-11-15 21:14:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 21:14:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-11-15 21:14:39,882 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 31 [2019-11-15 21:14:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:39,882 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-11-15 21:14:39,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:14:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-11-15 21:14:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:14:39,884 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:39,884 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:39,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash -343567321, now seen corresponding path program 1 times [2019-11-15 21:14:39,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:39,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814654067] [2019-11-15 21:14:39,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:39,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:39,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:40,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814654067] [2019-11-15 21:14:40,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841095921] [2019-11-15 21:14:40,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:14:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:40,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:14:40,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:40,251 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:14:40,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 21:14:40,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547601947] [2019-11-15 21:14:40,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:14:40,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:40,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:14:40,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:14:40,253 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 9 states. [2019-11-15 21:14:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:40,658 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2019-11-15 21:14:40,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:14:40,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-15 21:14:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:40,659 INFO L225 Difference]: With dead ends: 106 [2019-11-15 21:14:40,659 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 21:14:40,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:14:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 21:14:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2019-11-15 21:14:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-15 21:14:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-15 21:14:40,666 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 31 [2019-11-15 21:14:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:40,667 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-15 21:14:40,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:14:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-15 21:14:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:14:40,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:40,669 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:40,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:14:40,869 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1504093175, now seen corresponding path program 2 times [2019-11-15 21:14:40,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:40,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538475722] [2019-11-15 21:14:40,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:40,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:14:41,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538475722] [2019-11-15 21:14:41,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:41,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 21:14:41,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880104295] [2019-11-15 21:14:41,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:14:41,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:41,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:14:41,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:14:41,251 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 16 states. [2019-11-15 21:14:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:42,029 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-11-15 21:14:42,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:14:42,029 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-11-15 21:14:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:42,031 INFO L225 Difference]: With dead ends: 101 [2019-11-15 21:14:42,031 INFO L226 Difference]: Without dead ends: 101 [2019-11-15 21:14:42,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-15 21:14:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-15 21:14:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2019-11-15 21:14:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-15 21:14:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-11-15 21:14:42,037 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 44 [2019-11-15 21:14:42,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:42,037 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-11-15 21:14:42,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:14:42,038 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-11-15 21:14:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:14:42,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:42,039 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:42,040 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:42,040 INFO L82 PathProgramCache]: Analyzing trace with hash -732402631, now seen corresponding path program 1 times [2019-11-15 21:14:42,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:42,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846228508] [2019-11-15 21:14:42,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:42,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:42,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:14:42,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846228508] [2019-11-15 21:14:42,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:42,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 21:14:42,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584374717] [2019-11-15 21:14:42,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:14:42,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:14:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:14:42,276 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 14 states. [2019-11-15 21:14:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:42,962 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2019-11-15 21:14:42,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:14:42,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2019-11-15 21:14:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:42,964 INFO L225 Difference]: With dead ends: 98 [2019-11-15 21:14:42,964 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 21:14:42,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:14:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 21:14:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2019-11-15 21:14:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-15 21:14:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-15 21:14:42,969 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 46 [2019-11-15 21:14:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:42,970 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-15 21:14:42,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:14:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-15 21:14:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:14:42,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:42,972 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:42,972 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash -732402630, now seen corresponding path program 1 times [2019-11-15 21:14:42,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:42,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939552625] [2019-11-15 21:14:42,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:42,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:42,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:14:43,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939552625] [2019-11-15 21:14:43,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:43,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:14:43,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124414752] [2019-11-15 21:14:43,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:14:43,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:43,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:14:43,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:14:43,081 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 6 states. [2019-11-15 21:14:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:43,338 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2019-11-15 21:14:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:14:43,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-15 21:14:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:43,340 INFO L225 Difference]: With dead ends: 103 [2019-11-15 21:14:43,340 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 21:14:43,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:14:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 21:14:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2019-11-15 21:14:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-15 21:14:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-15 21:14:43,345 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 46 [2019-11-15 21:14:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:43,345 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-15 21:14:43,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:14:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-15 21:14:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:14:43,347 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:43,347 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:43,347 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash 955614394, now seen corresponding path program 1 times [2019-11-15 21:14:43,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:43,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161503400] [2019-11-15 21:14:43,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:14:43,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161503400] [2019-11-15 21:14:43,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:43,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:14:43,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902984698] [2019-11-15 21:14:43,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:14:43,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:14:43,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:14:43,467 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 7 states. [2019-11-15 21:14:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:43,755 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2019-11-15 21:14:43,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:43,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-15 21:14:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:43,757 INFO L225 Difference]: With dead ends: 108 [2019-11-15 21:14:43,757 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 21:14:43,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:14:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 21:14:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2019-11-15 21:14:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 21:14:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2019-11-15 21:14:43,762 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 47 [2019-11-15 21:14:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:43,763 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2019-11-15 21:14:43,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:14:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2019-11-15 21:14:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:14:43,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:43,765 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:43,765 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:43,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash 711885650, now seen corresponding path program 1 times [2019-11-15 21:14:43,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:43,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716839312] [2019-11-15 21:14:43,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:43,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:14:44,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716839312] [2019-11-15 21:14:44,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:44,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:14:44,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24135738] [2019-11-15 21:14:44,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:14:44,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:44,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:14:44,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:14:44,030 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 15 states. [2019-11-15 21:14:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:44,799 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2019-11-15 21:14:44,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:14:44,799 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-11-15 21:14:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:44,800 INFO L225 Difference]: With dead ends: 111 [2019-11-15 21:14:44,800 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 21:14:44,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:14:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 21:14:44,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2019-11-15 21:14:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 21:14:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-15 21:14:44,805 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 54 [2019-11-15 21:14:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:44,806 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-15 21:14:44,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:14:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-15 21:14:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:14:44,807 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:44,808 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:44,808 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:44,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash 711885651, now seen corresponding path program 1 times [2019-11-15 21:14:44,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:44,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213188776] [2019-11-15 21:14:44,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:44,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:44,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:14:45,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213188776] [2019-11-15 21:14:45,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:45,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 21:14:45,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029956467] [2019-11-15 21:14:45,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 21:14:45,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:45,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 21:14:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:14:45,233 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 17 states. [2019-11-15 21:14:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:45,891 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-11-15 21:14:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:14:45,891 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-11-15 21:14:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:45,892 INFO L225 Difference]: With dead ends: 110 [2019-11-15 21:14:45,892 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 21:14:45,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-11-15 21:14:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 21:14:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2019-11-15 21:14:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 21:14:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-11-15 21:14:45,897 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 54 [2019-11-15 21:14:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:45,897 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-11-15 21:14:45,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 21:14:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-11-15 21:14:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:14:45,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:45,899 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:45,900 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:14:45,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:45,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1572237498, now seen corresponding path program 1 times [2019-11-15 21:14:45,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:45,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40294663] [2019-11-15 21:14:45,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:45,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:45,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:14:46,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40294663] [2019-11-15 21:14:46,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504539435] [2019-11-15 21:14:46,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:14:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:47,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 21:14:47,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:47,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:14:47,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:47,276 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 21:14:47,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:47,297 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:14:47,298 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 21:14:47,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-15 21:14:47,332 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 13 treesize of output 9 [2019-11-15 21:14:47,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:47,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:47,339 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 21:14:47,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-11-15 21:14:47,587 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 11 treesize of output 5 [2019-11-15 21:14:47,588 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 21:14:47,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:47,594 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 21:14:47,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:9 [2019-11-15 21:15:23,956 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 21:15:23,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:15:23,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 21:15:23,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:23,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:23,974 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 21:15:23,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:17 [2019-11-15 21:15:24,077 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 21 treesize of output 9 [2019-11-15 21:15:24,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:24,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:24,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:15:24,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-11-15 21:15:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:15:24,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:15:24,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 37 [2019-11-15 21:15:24,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399498940] [2019-11-15 21:15:24,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 21:15:24,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:24,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 21:15:24,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1287, Unknown=23, NotChecked=0, Total=1406 [2019-11-15 21:15:24,100 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 38 states. [2019-11-15 21:15:53,337 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-11-15 21:16:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:31,459 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2019-11-15 21:16:31,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 21:16:31,460 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 55 [2019-11-15 21:16:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:31,461 INFO L225 Difference]: With dead ends: 156 [2019-11-15 21:16:31,462 INFO L226 Difference]: Without dead ends: 156 [2019-11-15 21:16:31,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=373, Invalid=3509, Unknown=24, NotChecked=0, Total=3906 [2019-11-15 21:16:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-15 21:16:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 112. [2019-11-15 21:16:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 21:16:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2019-11-15 21:16:31,475 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 55 [2019-11-15 21:16:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:31,475 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2019-11-15 21:16:31,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 21:16:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2019-11-15 21:16:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:16:31,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:31,480 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:31,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:31,681 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:16:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1572237497, now seen corresponding path program 1 times [2019-11-15 21:16:31,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:31,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714700415] [2019-11-15 21:16:31,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:31,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:31,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:16:32,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714700415] [2019-11-15 21:16:32,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455826973] [2019-11-15 21:16:32,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:16:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:33,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 82 conjunts are in the unsatisfiable core [2019-11-15 21:16:33,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:33,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:16:33,463 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 14 treesize of output 16 [2019-11-15 21:16:33,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:33,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:33,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:33,480 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 21:16:33,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:33,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:33,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:16:33,489 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-15 21:16:33,572 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 13 treesize of output 9 [2019-11-15 21:16:33,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:33,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:33,589 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 13 treesize of output 9 [2019-11-15 21:16:33,589 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:33,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:33,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:16:33,601 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:44 [2019-11-15 21:16:33,991 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 30 treesize of output 18 [2019-11-15 21:16:33,992 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 21:16:34,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:34,011 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 23 treesize of output 11 [2019-11-15 21:16:34,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:34,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:34,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:16:34,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:21 [2019-11-15 21:16:46,504 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 21:16:46,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:16:46,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2019-11-15 21:16:46,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:46,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:46,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:16:46,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2019-11-15 21:16:46,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:46,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:46,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:16:46,613 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:91, output treesize:58 [2019-11-15 21:16:46,860 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 39 treesize of output 21 [2019-11-15 21:16:46,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:46,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:46,872 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 32 treesize of output 14 [2019-11-15 21:16:46,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:46,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:46,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:16:46,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:62, output treesize:20 [2019-11-15 21:16:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:47,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:16:47,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 48 [2019-11-15 21:16:47,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637566412] [2019-11-15 21:16:47,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-11-15 21:16:47,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:47,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-11-15 21:16:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2229, Unknown=5, NotChecked=0, Total=2352 [2019-11-15 21:16:47,031 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand 49 states. [2019-11-15 21:17:21,092 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-15 21:17:28,086 WARN L191 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-11-15 21:17:30,529 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 59 [2019-11-15 21:17:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:47,426 INFO L93 Difference]: Finished difference Result 200 states and 224 transitions. [2019-11-15 21:17:47,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 21:17:47,427 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 55 [2019-11-15 21:17:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:47,428 INFO L225 Difference]: With dead ends: 200 [2019-11-15 21:17:47,428 INFO L226 Difference]: Without dead ends: 200 [2019-11-15 21:17:47,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=387, Invalid=5005, Unknown=10, NotChecked=0, Total=5402 [2019-11-15 21:17:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-15 21:17:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 126. [2019-11-15 21:17:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 21:17:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2019-11-15 21:17:47,438 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 55 [2019-11-15 21:17:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:47,438 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2019-11-15 21:17:47,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-11-15 21:17:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2019-11-15 21:17:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:17:47,448 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:47,449 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:47,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:47,652 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:17:47,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:47,652 INFO L82 PathProgramCache]: Analyzing trace with hash -761437406, now seen corresponding path program 1 times [2019-11-15 21:17:47,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:47,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460649965] [2019-11-15 21:17:47,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:47,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:47,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 21:17:47,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460649965] [2019-11-15 21:17:47,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:47,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:17:47,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935489823] [2019-11-15 21:17:47,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:17:47,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:17:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:17:47,763 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand 8 states. [2019-11-15 21:17:48,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:48,093 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2019-11-15 21:17:48,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:17:48,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-11-15 21:17:48,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:48,095 INFO L225 Difference]: With dead ends: 146 [2019-11-15 21:17:48,095 INFO L226 Difference]: Without dead ends: 146 [2019-11-15 21:17:48,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:17:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-15 21:17:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2019-11-15 21:17:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 21:17:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-11-15 21:17:48,102 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 57 [2019-11-15 21:17:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:48,102 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-11-15 21:17:48,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:17:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-11-15 21:17:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:17:48,103 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:48,103 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:48,104 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:17:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:48,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1907318596, now seen corresponding path program 2 times [2019-11-15 21:17:48,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:48,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862793421] [2019-11-15 21:17:48,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:48,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:48,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 21:17:48,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862793421] [2019-11-15 21:17:48,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508110974] [2019-11-15 21:17:48,274 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:17:48,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:17:48,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:17:48,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:17:48,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 21:17:48,448 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:17:48,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-11-15 21:17:48,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578401355] [2019-11-15 21:17:48,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:17:48,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:48,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:17:48,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:17:48,449 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 10 states. [2019-11-15 21:17:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:48,879 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-11-15 21:17:48,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:17:48,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-11-15 21:17:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:48,881 INFO L225 Difference]: With dead ends: 123 [2019-11-15 21:17:48,881 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 21:17:48,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:17:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 21:17:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2019-11-15 21:17:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:17:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2019-11-15 21:17:48,886 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 58 [2019-11-15 21:17:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:48,887 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2019-11-15 21:17:48,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:17:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2019-11-15 21:17:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:17:48,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:48,888 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:49,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:49,093 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:17:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash -486654524, now seen corresponding path program 1 times [2019-11-15 21:17:49,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:49,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34294238] [2019-11-15 21:17:49,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:49,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:49,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:17:49,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34294238] [2019-11-15 21:17:49,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:49,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 21:17:49,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380199640] [2019-11-15 21:17:49,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 21:17:49,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:49,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 21:17:49,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:17:49,521 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 17 states. [2019-11-15 21:17:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:50,166 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2019-11-15 21:17:50,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:17:50,167 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-11-15 21:17:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:50,168 INFO L225 Difference]: With dead ends: 121 [2019-11-15 21:17:50,168 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 21:17:50,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2019-11-15 21:17:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 21:17:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2019-11-15 21:17:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-15 21:17:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-11-15 21:17:50,173 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 65 [2019-11-15 21:17:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:50,173 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-11-15 21:17:50,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 21:17:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2019-11-15 21:17:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:17:50,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:50,175 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:50,175 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:17:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 290556232, now seen corresponding path program 3 times [2019-11-15 21:17:50,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:50,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649663511] [2019-11-15 21:17:50,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:50,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:50,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 21:17:50,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649663511] [2019-11-15 21:17:50,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981834214] [2019-11-15 21:17:50,355 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:17:50,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 21:17:50,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:17:50,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:17:50,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:17:50,662 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:17:50,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-15 21:17:50,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883408458] [2019-11-15 21:17:50,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 21:17:50,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:50,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 21:17:50,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:17:50,668 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 17 states. [2019-11-15 21:17:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:51,206 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2019-11-15 21:17:51,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:17:51,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-11-15 21:17:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:51,208 INFO L225 Difference]: With dead ends: 111 [2019-11-15 21:17:51,208 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 21:17:51,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-15 21:17:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 21:17:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-11-15 21:17:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 21:17:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-11-15 21:17:51,212 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 66 [2019-11-15 21:17:51,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:51,213 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-11-15 21:17:51,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 21:17:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-11-15 21:17:51,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:17:51,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:51,214 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:51,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:51,418 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:17:51,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:51,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1883318623, now seen corresponding path program 1 times [2019-11-15 21:17:51,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:51,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987324831] [2019-11-15 21:17:51,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:51,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:51,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:17:51,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987324831] [2019-11-15 21:17:51,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:51,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 21:17:51,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426801260] [2019-11-15 21:17:51,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:17:51,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:51,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:17:51,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:17:51,762 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 16 states. [2019-11-15 21:17:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:52,371 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-11-15 21:17:52,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:17:52,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-11-15 21:17:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:52,373 INFO L225 Difference]: With dead ends: 110 [2019-11-15 21:17:52,373 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 21:17:52,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:17:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 21:17:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2019-11-15 21:17:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 21:17:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-15 21:17:52,377 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 68 [2019-11-15 21:17:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:52,378 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-15 21:17:52,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:17:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-15 21:17:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:17:52,378 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:52,379 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:52,379 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:17:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1884646022, now seen corresponding path program 1 times [2019-11-15 21:17:52,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:52,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868708127] [2019-11-15 21:17:52,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:52,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:52,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:17:52,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868708127] [2019-11-15 21:17:52,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:52,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:17:52,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261047365] [2019-11-15 21:17:52,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:17:52,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:52,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:17:52,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:17:52,641 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 15 states. [2019-11-15 21:17:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:53,460 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-15 21:17:53,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:17:53,461 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-11-15 21:17:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:53,462 INFO L225 Difference]: With dead ends: 107 [2019-11-15 21:17:53,462 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 21:17:53,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-11-15 21:17:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 21:17:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-11-15 21:17:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 21:17:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-15 21:17:53,465 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 68 [2019-11-15 21:17:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:53,465 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-15 21:17:53,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:17:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-15 21:17:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:17:53,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:53,467 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:17:53,467 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:17:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash 10294732, now seen corresponding path program 1 times [2019-11-15 21:17:53,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:53,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672531616] [2019-11-15 21:17:53,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:53,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:53,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 21:17:53,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672531616] [2019-11-15 21:17:53,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711238188] [2019-11-15 21:17:53,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:17:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:54,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:17:54,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 21:17:54,143 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:17:54,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-11-15 21:17:54,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752607720] [2019-11-15 21:17:54,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 21:17:54,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:54,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 21:17:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:17:54,145 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 21 states. [2019-11-15 21:17:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:55,384 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-11-15 21:17:55,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 21:17:55,386 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-11-15 21:17:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:17:55,387 INFO L225 Difference]: With dead ends: 129 [2019-11-15 21:17:55,387 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 21:17:55,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 21:17:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 21:17:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2019-11-15 21:17:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 21:17:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2019-11-15 21:17:55,392 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 68 [2019-11-15 21:17:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:17:55,393 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2019-11-15 21:17:55,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 21:17:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2019-11-15 21:17:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 21:17:55,394 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:17:55,394 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 21:17:55,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:17:55,598 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:17:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash -812191990, now seen corresponding path program 1 times [2019-11-15 21:17:55,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:55,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455502798] [2019-11-15 21:17:55,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:55,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:55,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:17:56,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455502798] [2019-11-15 21:17:56,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475863658] [2019-11-15 21:17:56,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:17:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:56,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 78 conjunts are in the unsatisfiable core [2019-11-15 21:17:56,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:56,912 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:56,913 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 21:17:56,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:17:56,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:56,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:17:56,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-15 21:17:56,985 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 13 treesize of output 9 [2019-11-15 21:17:56,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:17:56,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:56,989 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 21:17:56,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-11-15 21:17:58,521 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-11-15 21:17:58,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:17:58,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-15 21:17:58,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:17:58,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:58,536 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 21:17:58,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:10 [2019-11-15 21:18:00,756 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 21:18:00,782 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:00,783 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 67 [2019-11-15 21:18:00,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:00,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:00,807 INFO L567 ElimStorePlain]: treesize reduction 36, result has 37.9 percent of original size [2019-11-15 21:18:00,807 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 21:18:00,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:22 [2019-11-15 21:18:01,133 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 31 treesize of output 13 [2019-11-15 21:18:01,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:01,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:01,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:01,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:5 [2019-11-15 21:18:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2019-11-15 21:18:01,158 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:01,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 51 [2019-11-15 21:18:01,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755927088] [2019-11-15 21:18:01,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-15 21:18:01,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:01,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-15 21:18:01,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2413, Unknown=1, NotChecked=98, Total=2652 [2019-11-15 21:18:01,161 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 52 states. [2019-11-15 21:18:05,090 WARN L191 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-11-15 21:18:07,396 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 21:18:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:08,694 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2019-11-15 21:18:08,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 21:18:08,694 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 79 [2019-11-15 21:18:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:08,695 INFO L225 Difference]: With dead ends: 121 [2019-11-15 21:18:08,696 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 21:18:08,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=379, Invalid=4880, Unknown=1, NotChecked=142, Total=5402 [2019-11-15 21:18:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 21:18:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-11-15 21:18:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:18:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2019-11-15 21:18:08,702 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 79 [2019-11-15 21:18:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:08,702 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2019-11-15 21:18:08,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-15 21:18:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2019-11-15 21:18:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 21:18:08,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:08,705 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 21:18:08,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:08,910 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:18:08,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:08,910 INFO L82 PathProgramCache]: Analyzing trace with hash -812191989, now seen corresponding path program 1 times [2019-11-15 21:18:08,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:08,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8959541] [2019-11-15 21:18:08,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:08,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:08,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:18:10,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8959541] [2019-11-15 21:18:10,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203991578] [2019-11-15 21:18:10,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:18:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:10,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 104 conjunts are in the unsatisfiable core [2019-11-15 21:18:10,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:10,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:18:10,856 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 14 treesize of output 16 [2019-11-15 21:18:10,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:10,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:10,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:10,872 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 21:18:10,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:10,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:10,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:10,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-15 21:18:10,992 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 13 treesize of output 9 [2019-11-15 21:18:10,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:11,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:11,007 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 13 treesize of output 9 [2019-11-15 21:18:11,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:11,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:11,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:11,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:44 [2019-11-15 21:18:11,513 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 30 treesize of output 18 [2019-11-15 21:18:11,514 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 21:18:11,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:11,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-15 21:18:11,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:11,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:11,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:11,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:21 [2019-11-15 21:18:30,443 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 21:18:30,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:18:30,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2019-11-15 21:18:30,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:30,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:30,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:18:30,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2019-11-15 21:18:30,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:30,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:30,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:30,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:91, output treesize:58 [2019-11-15 21:18:30,671 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 30 treesize of output 18 [2019-11-15 21:18:30,671 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 21:18:30,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:30,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-15 21:18:30,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:30,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:30,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:30,698 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:21 [2019-11-15 21:18:50,128 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-15 21:18:50,154 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:50,155 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 96 treesize of output 90 [2019-11-15 21:18:50,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:50,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:50,199 INFO L567 ElimStorePlain]: treesize reduction 36, result has 71.7 percent of original size [2019-11-15 21:18:50,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 26 [2019-11-15 21:18:50,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:50,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:50,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:50,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:124, output treesize:58 [2019-11-15 21:18:50,693 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 39 treesize of output 21 [2019-11-15 21:18:50,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:50,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:50,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2019-11-15 21:18:50,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:50,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:50,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:50,715 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:20 [2019-11-15 21:18:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:18:54,952 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:54,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 60 [2019-11-15 21:18:54,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924874047] [2019-11-15 21:18:54,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-11-15 21:18:54,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-11-15 21:18:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3473, Unknown=18, NotChecked=0, Total=3660 [2019-11-15 21:18:54,955 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 61 states. [2019-11-15 21:19:50,902 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-11-15 21:19:59,267 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-15 21:20:10,973 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 21:20:19,798 WARN L191 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-15 21:20:24,797 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-11-15 21:20:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:32,298 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-11-15 21:20:32,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 21:20:32,299 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 79 [2019-11-15 21:20:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:32,300 INFO L225 Difference]: With dead ends: 127 [2019-11-15 21:20:32,300 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 21:20:32,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 83.7s TimeCoverageRelationStatistics Valid=533, Invalid=7270, Unknown=29, NotChecked=0, Total=7832 [2019-11-15 21:20:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 21:20:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2019-11-15 21:20:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 21:20:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2019-11-15 21:20:32,307 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 79 [2019-11-15 21:20:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:32,308 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2019-11-15 21:20:32,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-11-15 21:20:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2019-11-15 21:20:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 21:20:32,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:32,309 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 21:20:32,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:32,510 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:20:32,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:32,510 INFO L82 PathProgramCache]: Analyzing trace with hash -812191934, now seen corresponding path program 1 times [2019-11-15 21:20:32,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:32,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340608246] [2019-11-15 21:20:32,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:32,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:32,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 21:20:32,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340608246] [2019-11-15 21:20:32,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515705482] [2019-11-15 21:20:32,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:20:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:32,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:20:32,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:20:32,836 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:32,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2019-11-15 21:20:32,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989559027] [2019-11-15 21:20:32,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:20:32,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:32,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:20:32,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:20:32,838 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 11 states. [2019-11-15 21:20:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:33,204 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2019-11-15 21:20:33,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:20:33,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2019-11-15 21:20:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:33,205 INFO L225 Difference]: With dead ends: 107 [2019-11-15 21:20:33,205 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 21:20:33,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:20:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 21:20:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-11-15 21:20:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 21:20:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-11-15 21:20:33,208 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 79 [2019-11-15 21:20:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:33,208 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-11-15 21:20:33,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:20:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-11-15 21:20:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:20:33,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:33,210 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 21:20:33,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:33,410 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:20:33,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:33,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1253766992, now seen corresponding path program 1 times [2019-11-15 21:20:33,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:33,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731537730] [2019-11-15 21:20:33,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:33,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:33,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 21:20:33,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731537730] [2019-11-15 21:20:33,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984777702] [2019-11-15 21:20:33,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:20:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:33,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:20:33,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 21:20:33,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:20:33,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-11-15 21:20:33,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275367070] [2019-11-15 21:20:33,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:20:33,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:33,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:20:33,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:20:33,828 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 6 states. [2019-11-15 21:20:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:33,925 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-11-15 21:20:33,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:20:33,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 21:20:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:33,927 INFO L225 Difference]: With dead ends: 109 [2019-11-15 21:20:33,927 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 21:20:33,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:20:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 21:20:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-11-15 21:20:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 21:20:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-11-15 21:20:33,931 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 93 [2019-11-15 21:20:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:33,931 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-11-15 21:20:33,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:20:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-11-15 21:20:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:20:33,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:33,932 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:34,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:34,141 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:20:34,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash -164766544, now seen corresponding path program 1 times [2019-11-15 21:20:34,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:34,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552922076] [2019-11-15 21:20:34,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:34,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:34,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 21:20:35,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552922076] [2019-11-15 21:20:35,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792310533] [2019-11-15 21:20:35,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:20:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:35,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-15 21:20:35,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:36,054 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:36,054 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 21:20:36,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:36,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:36,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:36,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 21:20:36,151 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 13 treesize of output 9 [2019-11-15 21:20:36,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:36,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:36,160 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 21:20:36,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-15 21:20:38,488 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-11-15 21:20:38,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:38,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-15 21:20:38,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:38,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:38,519 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 21:20:38,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-11-15 21:20:40,757 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 21:20:40,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:40,806 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 67 [2019-11-15 21:20:40,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:40,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:40,850 INFO L567 ElimStorePlain]: treesize reduction 36, result has 43.8 percent of original size [2019-11-15 21:20:40,850 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 21:20:40,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:28 [2019-11-15 21:20:41,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:41,644 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 21:20:41,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:41,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:41,646 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 21:20:41,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:41,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:41,659 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 2 xjuncts. [2019-11-15 21:20:41,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-11-15 21:20:42,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:42,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 32 [2019-11-15 21:20:42,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:42,039 INFO L567 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-11-15 21:20:42,039 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 21:20:42,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-11-15 21:20:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-11-15 21:20:42,220 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:42,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 57 [2019-11-15 21:20:42,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392006427] [2019-11-15 21:20:42,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-15 21:20:42,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-15 21:20:42,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3005, Unknown=1, NotChecked=110, Total=3306 [2019-11-15 21:20:42,224 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 58 states. [2019-11-15 21:20:46,007 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-11-15 21:20:48,433 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 21:20:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:49,672 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-11-15 21:20:49,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 21:20:49,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 96 [2019-11-15 21:20:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:49,674 INFO L225 Difference]: With dead ends: 123 [2019-11-15 21:20:49,674 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 21:20:49,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 81 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=484, Invalid=5839, Unknown=1, NotChecked=156, Total=6480 [2019-11-15 21:20:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 21:20:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2019-11-15 21:20:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 21:20:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-15 21:20:49,679 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 96 [2019-11-15 21:20:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:49,679 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-15 21:20:49,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-15 21:20:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-15 21:20:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:20:49,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:49,680 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:49,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:20:49,881 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:20:49,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:49,881 INFO L82 PathProgramCache]: Analyzing trace with hash -164766543, now seen corresponding path program 1 times [2019-11-15 21:20:49,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:49,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383297093] [2019-11-15 21:20:49,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:49,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:49,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:20:52,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383297093] [2019-11-15 21:20:52,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583076248] [2019-11-15 21:20:52,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:20:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:52,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 117 conjunts are in the unsatisfiable core [2019-11-15 21:20:52,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:53,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:53,293 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 21:20:53,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:53,307 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 14 treesize of output 16 [2019-11-15 21:20:53,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:53,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2019-11-15 21:20:53,487 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 13 treesize of output 9 [2019-11-15 21:20:53,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:53,512 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 13 treesize of output 9 [2019-11-15 21:20:53,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:53,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,528 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:59 [2019-11-15 21:20:54,004 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 30 treesize of output 18 [2019-11-15 21:20:54,005 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 21:20:54,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:54,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2019-11-15 21:20:54,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:54,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:54,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:20:54,039 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:21 [2019-11-15 21:20:54,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:54,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2019-11-15 21:20:54,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:54,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:54,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:54,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2019-11-15 21:20:54,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:54,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:54,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:20:54,425 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:73 [2019-11-15 21:20:54,530 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 38 treesize of output 20 [2019-11-15 21:20:54,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:54,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:54,545 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 22 treesize of output 10 [2019-11-15 21:20:54,546 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 21:20:54,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:54,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:20:54,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:21 [2019-11-15 21:21:26,133 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-15 21:21:26,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:26,167 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 96 treesize of output 90 [2019-11-15 21:21:26,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:26,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:26,225 INFO L567 ElimStorePlain]: treesize reduction 36, result has 74.6 percent of original size [2019-11-15 21:21:26,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 29 [2019-11-15 21:21:26,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:26,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:26,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:26,250 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:139, output treesize:73 [2019-11-15 21:21:31,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:31,445 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2019-11-15 21:21:31,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:31,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:31,447 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 21:21:31,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:31,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:31,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2019-11-15 21:21:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:31,475 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 21:21:31,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:31,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:31,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:31,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:31,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-11-15 21:21:31,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:100 [2019-11-15 21:21:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 21:21:40,398 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:40,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 33] total 76 [2019-11-15 21:21:40,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942156875] [2019-11-15 21:21:40,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-11-15 21:21:40,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:40,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-11-15 21:21:40,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=5607, Unknown=18, NotChecked=0, Total=5852 [2019-11-15 21:21:40,402 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 77 states. [2019-11-15 21:22:18,052 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-11-15 21:22:34,404 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-11-15 21:22:34,651 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2019-11-15 21:22:41,115 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-15 21:22:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:52,599 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2019-11-15 21:22:52,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-15 21:22:52,600 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 96 [2019-11-15 21:22:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:52,600 INFO L225 Difference]: With dead ends: 120 [2019-11-15 21:22:52,601 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 21:22:52,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 70 SyntacticMatches, 9 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2522 ImplicationChecksByTransitivity, 72.1s TimeCoverageRelationStatistics Valid=736, Invalid=12121, Unknown=25, NotChecked=0, Total=12882 [2019-11-15 21:22:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 21:22:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2019-11-15 21:22:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 21:22:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-11-15 21:22:52,608 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 96 [2019-11-15 21:22:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:52,608 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-11-15 21:22:52,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-11-15 21:22:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-11-15 21:22:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:22:52,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:52,609 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:52,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:52,814 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:22:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash 586188626, now seen corresponding path program 1 times [2019-11-15 21:22:52,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:52,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952890548] [2019-11-15 21:22:52,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:52,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:52,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 21:22:54,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952890548] [2019-11-15 21:22:54,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681117240] [2019-11-15 21:22:54,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:22:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:54,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-15 21:22:54,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:54,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:22:54,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:54,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:22:54,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:54,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:54,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:22:54,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-11-15 21:22:54,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:22:54,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:54,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:54,624 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 21:22:54,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-11-15 21:22:56,230 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-11-15 21:22:56,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:22:56,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-15 21:22:56,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:56,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:56,252 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 21:22:56,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-11-15 21:22:58,389 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))))) is different from true [2019-11-15 21:22:58,414 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:22:58,414 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 44 treesize of output 58 [2019-11-15 21:22:58,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:22:58,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:22:58,433 INFO L567 ElimStorePlain]: treesize reduction 28, result has 37.8 percent of original size [2019-11-15 21:22:58,433 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 21:22:58,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:17 [2019-11-15 21:23:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-11-15 21:23:02,396 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:23:02,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 54 [2019-11-15 21:23:02,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607751797] [2019-11-15 21:23:02,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-11-15 21:23:02,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:23:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-11-15 21:23:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2485, Unknown=2, NotChecked=202, Total=2862 [2019-11-15 21:23:02,398 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 54 states. [2019-11-15 21:23:22,888 WARN L191 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-11-15 21:23:33,202 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-15 21:23:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:23:36,490 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2019-11-15 21:23:36,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 21:23:36,491 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 99 [2019-11-15 21:23:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:23:36,492 INFO L225 Difference]: With dead ends: 118 [2019-11-15 21:23:36,492 INFO L226 Difference]: Without dead ends: 116 [2019-11-15 21:23:36,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=495, Invalid=5515, Unknown=4, NotChecked=306, Total=6320 [2019-11-15 21:23:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-15 21:23:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-15 21:23:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 21:23:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2019-11-15 21:23:36,501 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 99 [2019-11-15 21:23:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:23:36,501 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2019-11-15 21:23:36,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-11-15 21:23:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2019-11-15 21:23:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:23:36,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:23:36,502 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 21:23:36,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:23:36,703 INFO L410 AbstractCegarLoop]: === Iteration 30 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:23:36,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:23:36,703 INFO L82 PathProgramCache]: Analyzing trace with hash 587516025, now seen corresponding path program 1 times [2019-11-15 21:23:36,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:23:36,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668873607] [2019-11-15 21:23:36,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:36,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:23:36,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:23:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:23:38,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668873607] [2019-11-15 21:23:38,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786903243] [2019-11-15 21:23:38,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:23:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:23:38,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 85 conjunts are in the unsatisfiable core [2019-11-15 21:23:38,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:23:39,177 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 21:23:39,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:39,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:39,181 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 21:23:39,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-11-15 21:23:39,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:39,390 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 21:23:39,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:39,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:39,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:23:39,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 21:23:39,515 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 13 treesize of output 9 [2019-11-15 21:23:39,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:39,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:39,523 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 21:23:39,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2019-11-15 21:23:39,865 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 20 treesize of output 8 [2019-11-15 21:23:39,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:39,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:39,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:23:39,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-11-15 21:23:42,002 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-11-15 21:23:42,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:23:42,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2019-11-15 21:23:42,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:42,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:42,022 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 21:23:42,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:26 [2019-11-15 21:23:42,028 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 20 treesize of output 8 [2019-11-15 21:23:42,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:42,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:42,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:23:42,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-11-15 21:23:44,254 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))))) is different from true [2019-11-15 21:23:44,278 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:44,278 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 53 treesize of output 65 [2019-11-15 21:23:44,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:23:44,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:23:44,294 INFO L567 ElimStorePlain]: treesize reduction 36, result has 41.9 percent of original size [2019-11-15 21:23:44,294 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 21:23:44,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:26 [2019-11-15 21:23:52,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:52,429 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2019-11-15 21:23:52,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:23:52,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:23:52,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:23:52,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:23:52,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-15 21:23:52,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:14 [2019-11-15 21:23:52,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:23:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-11-15 21:23:52,671 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:23:52,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 33] total 77 [2019-11-15 21:23:52,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696677772] [2019-11-15 21:23:52,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-11-15 21:23:52,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:23:52,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-11-15 21:23:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=5462, Unknown=3, NotChecked=298, Total=6006 [2019-11-15 21:23:52,673 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 78 states. [2019-11-15 21:24:00,280 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-15 21:24:06,471 WARN L191 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 21:24:09,194 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-15 21:24:14,517 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-15 21:24:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:17,141 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2019-11-15 21:24:17,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-15 21:24:17,142 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 99 [2019-11-15 21:24:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:24:17,143 INFO L225 Difference]: With dead ends: 116 [2019-11-15 21:24:17,143 INFO L226 Difference]: Without dead ends: 116 [2019-11-15 21:24:17,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 114 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2952 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=765, Invalid=12121, Unknown=4, NotChecked=450, Total=13340 [2019-11-15 21:24:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-15 21:24:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2019-11-15 21:24:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 21:24:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2019-11-15 21:24:17,148 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 99 [2019-11-15 21:24:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:24:17,148 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2019-11-15 21:24:17,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-11-15 21:24:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2019-11-15 21:24:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 21:24:17,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:17,149 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 21:24:17,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:24:17,350 INFO L410 AbstractCegarLoop]: === Iteration 31 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-11-15 21:24:17,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:17,350 INFO L82 PathProgramCache]: Analyzing trace with hash 698243733, now seen corresponding path program 2 times [2019-11-15 21:24:17,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:17,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123316063] [2019-11-15 21:24:17,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:17,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:17,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 21:24:19,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123316063] [2019-11-15 21:24:19,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867912502] [2019-11-15 21:24:19,584 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:24:19,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:24:19,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:24:19,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 136 conjunts are in the unsatisfiable core [2019-11-15 21:24:19,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:20,039 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_28|], 1=[|v_#memory_$Pointer$.base_42|]} [2019-11-15 21:24:20,042 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 13 treesize of output 9 [2019-11-15 21:24:20,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:20,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:20,055 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:24:20,057 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:24:20,058 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:24:20,060 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 14 treesize of output 13 [2019-11-15 21:24:20,061 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:20,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:20,065 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:24:20,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:20,073 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 21:24:20,073 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:47, output treesize:27 [2019-11-15 21:24:20,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:20,499 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 21:24:20,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:20,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:20,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:24:20,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-15 21:24:20,526 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:20,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:20,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:24:20,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-15 21:24:20,546 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:20,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:20,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:24:20,560 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-15 21:24:20,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-11-15 21:24:20,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:20,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:20,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-11-15 21:24:20,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:20,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:20,745 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 21:24:20,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2019-11-15 21:24:23,220 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.offset| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-11-15 21:24:23,256 INFO L341 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2019-11-15 21:24:23,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2019-11-15 21:24:23,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:23,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:23,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:23,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:23,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:23,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:23,259 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 21:24:23,297 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.9 percent of original size [2019-11-15 21:24:23,310 INFO L341 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2019-11-15 21:24:23,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2019-11-15 21:24:23,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:23,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:23,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:23,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:23,329 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 21:24:23,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:69 [2019-11-15 21:24:23,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,015 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-15 21:24:24,015 INFO L341 Elim1Store]: treesize reduction 14, result has 93.0 percent of original size [2019-11-15 21:24:24,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 266 [2019-11-15 21:24:24,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:24,081 INFO L496 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 21:24:24,170 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:24,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 188 [2019-11-15 21:24:24,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:24,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:25,475 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 264 DAG size of output: 141 [2019-11-15 21:24:25,476 INFO L567 ElimStorePlain]: treesize reduction 6158, result has 13.7 percent of original size [2019-11-15 21:24:25,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:25,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 246 [2019-11-15 21:24:25,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:24:25,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:25,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:24:25,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:24:25,668 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimArr_2, v_prenex_20, v_prenex_18], 1=[v_prenex_19, v_arrayElimArr_1, v_prenex_23, v_prenex_22, v_prenex_17], 4=[v_prenex_21, v_prenex_16]} [2019-11-15 21:24:25,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:24:25,869 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) 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.doElimOneRec(ElimStorePlain.java:256) 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) 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) [2019-11-15 21:24:25,872 INFO L168 Benchmark]: Toolchain (without parser) took 591370.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -79.5 MB). Peak memory consumption was 281.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:25,872 INFO L168 Benchmark]: CDTParser took 0.26 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 21:24:25,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:25,873 INFO L168 Benchmark]: Boogie Preprocessor took 87.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:25,873 INFO L168 Benchmark]: RCFGBuilder took 656.40 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:25,874 INFO L168 Benchmark]: TraceAbstraction took 589999.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.9 MB). Peak memory consumption was 264.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:25,875 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.26 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 622.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 656.40 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 589999.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.9 MB). Peak memory consumption was 264.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:24:28,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:24:28,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:24:28,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:24:28,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:24:28,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:24:28,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:24:28,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:24:28,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:24:28,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:24:28,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:24:28,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:24:28,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:24:28,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:24:28,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:24:28,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:24:28,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:24:28,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:24:28,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:24:28,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:24:28,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:24:28,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:24:28,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:24:28,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:24:28,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:24:28,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:24:28,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:24:28,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:24:28,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:24:28,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:24:28,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:24:28,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:24:28,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:24:28,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:24:28,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:24:28,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:24:28,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:24:28,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:24:28,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:24:28,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:24:28,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:24:28,076 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 21:24:28,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:24:28,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:24:28,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:24:28,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:24:28,092 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:24:28,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:24:28,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:24:28,093 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:24:28,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:24:28,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:24:28,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:24:28,094 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:24:28,094 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:24:28,094 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:24:28,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:24:28,095 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:24:28,095 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:24:28,095 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:24:28,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:24:28,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:24:28,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:24:28,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:24:28,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:24:28,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:24:28,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:24:28,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:24:28,097 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:24:28,097 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:24:28,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:24:28,098 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_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 -> ef034042979fe1e524a3655a8992190a25335ff0 [2019-11-15 21:24:28,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:24:28,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:24:28,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:24:28,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:24:28,153 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:24:28,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-11-15 21:24:28,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data/c488761b7/09cc4e4ed88f4e1ebab335ea12cd0d71/FLAGa7a990b49 [2019-11-15 21:24:28,690 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:24:28,691 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/sv-benchmarks/c/list-simple/sll2n_update_all.i [2019-11-15 21:24:28,703 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data/c488761b7/09cc4e4ed88f4e1ebab335ea12cd0d71/FLAGa7a990b49 [2019-11-15 21:24:29,051 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/bin/uautomizer/data/c488761b7/09cc4e4ed88f4e1ebab335ea12cd0d71 [2019-11-15 21:24:29,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:24:29,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:24:29,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:24:29,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:24:29,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:24:29,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:24:29" (1/1) ... [2019-11-15 21:24:29,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b000ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29, skipping insertion in model container [2019-11-15 21:24:29,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:24:29" (1/1) ... [2019-11-15 21:24:29,069 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:24:29,107 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:24:29,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:24:29,555 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:24:29,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:24:29,661 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:24:29,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29 WrapperNode [2019-11-15 21:24:29,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:24:29,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:24:29,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:24:29,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:24:29,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29" (1/1) ... [2019-11-15 21:24:29,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29" (1/1) ... [2019-11-15 21:24:29,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29" (1/1) ... [2019-11-15 21:24:29,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29" (1/1) ... [2019-11-15 21:24:29,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29" (1/1) ... [2019-11-15 21:24:29,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29" (1/1) ... [2019-11-15 21:24:29,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29" (1/1) ... [2019-11-15 21:24:29,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:24:29,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:24:29,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:24:29,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:24:29,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:24:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:24:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:24:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:24:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:24:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:24:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 21:24:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-15 21:24:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-11-15 21:24:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2019-11-15 21:24:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2019-11-15 21:24:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:24:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:24:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:24:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:24:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:24:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:24:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:24:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:24:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:24:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:24:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:24:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:24:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:24:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:24:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:24:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:24:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:24:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:24:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:24:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:24:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:24:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:24:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:24:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:24:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:24:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:24:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:24:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:24:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:24:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:24:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:24:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:24:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:24:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:24:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:24:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:24:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:24:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:24:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:24:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:24:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:24:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:24:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:24:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:24:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:24:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:24:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:24:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:24:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:24:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:24:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:24:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:24:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:24:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:24:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:24:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:24:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:24:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:24:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:24:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:24:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:24:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:24:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:24:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:24:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:24:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:24:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:24:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:24:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:24:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:24:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:24:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:24:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:24:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:24:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:24:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:24:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:24:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:24:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:24:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:24:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:24:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:24:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:24:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:24:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:24:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:24:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:24:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:24:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:24:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:24:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:24:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:24:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:24:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:24:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:24:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:24:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:24:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:24:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:24:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:24:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:24:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:24:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:24:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:24:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:24:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:24:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:24:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:24:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 21:24:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:24:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:24:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:24:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-15 21:24:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-11-15 21:24:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:24:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:24:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2019-11-15 21:24:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:24:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2019-11-15 21:24:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:24:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:24:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:24:30,259 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:24:30,540 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:24:30,540 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 21:24:30,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:24:30 BoogieIcfgContainer [2019-11-15 21:24:30,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:24:30,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:24:30,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:24:30,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:24:30,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:24:29" (1/3) ... [2019-11-15 21:24:30,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519935f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:24:30, skipping insertion in model container [2019-11-15 21:24:30,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:29" (2/3) ... [2019-11-15 21:24:30,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519935f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:24:30, skipping insertion in model container [2019-11-15 21:24:30,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:24:30" (3/3) ... [2019-11-15 21:24:30,559 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2019-11-15 21:24:30,569 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:24:30,578 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-15 21:24:30,588 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-15 21:24:30,606 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:24:30,607 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:24:30,607 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:24:30,607 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:24:30,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:24:30,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:24:30,608 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:24:30,608 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:24:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-15 21:24:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:24:30,641 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:24:30,642 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:30,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:24:30,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:30,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1770400427, now seen corresponding path program 1 times [2019-11-15 21:24:30,662 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:24:30,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [36018064] [2019-11-15 21:24:30,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3471225b-fc39-41c7-80e4-3f4fe3d5793a/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 21:24:30,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:24:30,892 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 21:24:30,897 INFO L168 Benchmark]: Toolchain (without parser) took 1841.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 948.3 MB in the beginning and 1.0 GB in the end (delta: -99.1 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:30,898 INFO L168 Benchmark]: CDTParser took 0.22 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 21:24:30,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:30,899 INFO L168 Benchmark]: Boogie Preprocessor took 74.26 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 21:24:30,900 INFO L168 Benchmark]: RCFGBuilder took 804.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:30,900 INFO L168 Benchmark]: TraceAbstraction took 352.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:30,903 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.22 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 607.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.26 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 804.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 352.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...