./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 3a501c55d63fd9a2de7fb7a25d7fd900352e0181 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 20:26:16,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:26:16,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:26:16,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:26:16,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:26:16,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:26:16,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:26:16,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:26:16,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:26:16,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:26:16,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:26:16,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:26:16,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:26:16,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:26:16,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:26:16,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:26:16,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:26:16,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:26:16,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:26:16,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:26:16,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:26:16,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:26:16,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:26:16,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:26:16,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:26:16,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:26:16,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:26:16,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:26:16,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:26:16,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:26:16,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:26:16,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:26:16,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:26:16,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:26:16,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:26:16,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:26:16,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:26:16,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:26:16,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:26:16,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:26:16,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:26:16,730 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-29 20:26:16,757 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:26:16,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:26:16,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:26:16,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:26:16,759 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:26:16,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:26:16,760 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:26:16,761 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 20:26:16,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:26:16,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:26:16,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:26:16,762 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-29 20:26:16,762 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-29 20:26:16,762 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-29 20:26:16,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 20:26:16,763 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-29 20:26:16,763 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:26:16,764 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:26:16,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:26:16,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:26:16,765 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 20:26:16,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 20:26:16,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:26:16,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:26:16,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 20:26:16,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:26:16,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 20:26:16,767 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:26:16,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 -> 3a501c55d63fd9a2de7fb7a25d7fd900352e0181 [2020-11-29 20:26:17,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:26:17,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:26:17,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:26:17,036 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:26:17,037 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:26:17,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2020-11-29 20:26:17,115 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/data/be3dd59e1/e3cdef17688348f3b1aca583f28687f4/FLAGaf3a567eb [2020-11-29 20:26:17,637 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:26:17,643 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2020-11-29 20:26:17,664 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/data/be3dd59e1/e3cdef17688348f3b1aca583f28687f4/FLAGaf3a567eb [2020-11-29 20:26:17,965 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/data/be3dd59e1/e3cdef17688348f3b1aca583f28687f4 [2020-11-29 20:26:17,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:26:17,969 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-29 20:26:17,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:26:17,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:26:17,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:26:17,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:26:17" (1/1) ... [2020-11-29 20:26:17,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28327ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:17, skipping insertion in model container [2020-11-29 20:26:17,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:26:17" (1/1) ... [2020-11-29 20:26:17,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:26:18,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:26:18,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:26:18,393 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:26:18,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:26:18,519 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:26:18,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18 WrapperNode [2020-11-29 20:26:18,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:26:18,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:26:18,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:26:18,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:26:18,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18" (1/1) ... [2020-11-29 20:26:18,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18" (1/1) ... [2020-11-29 20:26:18,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18" (1/1) ... [2020-11-29 20:26:18,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18" (1/1) ... [2020-11-29 20:26:18,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18" (1/1) ... [2020-11-29 20:26:18,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18" (1/1) ... [2020-11-29 20:26:18,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18" (1/1) ... [2020-11-29 20:26:18,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:26:18,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:26:18,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:26:18,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:26:18,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:18,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-29 20:26:18,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:26:18,703 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-29 20:26:18,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-29 20:26:18,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-29 20:26:18,704 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-29 20:26:18,704 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-11-29 20:26:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-11-29 20:26:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2020-11-29 20:26:18,705 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2020-11-29 20:26:18,706 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2020-11-29 20:26:18,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-29 20:26:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-29 20:26:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-29 20:26:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-29 20:26:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-29 20:26:18,709 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-29 20:26:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:26:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-29 20:26:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-29 20:26:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-29 20:26:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-29 20:26:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-29 20:26:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-29 20:26:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-29 20:26:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-29 20:26:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-29 20:26:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-29 20:26:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-29 20:26:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-29 20:26:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-29 20:26:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-29 20:26:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-29 20:26:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-29 20:26:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-29 20:26:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-29 20:26:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-29 20:26:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-29 20:26:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-29 20:26:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-29 20:26:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-29 20:26:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-29 20:26:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-29 20:26:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-29 20:26:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-29 20:26:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-29 20:26:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-29 20:26:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-29 20:26:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-29 20:26:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-29 20:26:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-29 20:26:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-29 20:26:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-29 20:26:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-29 20:26:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-29 20:26:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-29 20:26:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-29 20:26:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-29 20:26:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-29 20:26:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-29 20:26:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-29 20:26:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-29 20:26:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-29 20:26:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-29 20:26:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-29 20:26:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-29 20:26:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-29 20:26:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-29 20:26:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-29 20:26:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-29 20:26:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-29 20:26:18,722 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-29 20:26:18,723 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-29 20:26:18,723 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-29 20:26:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-29 20:26:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-29 20:26:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-29 20:26:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-29 20:26:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-29 20:26:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-29 20:26:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-29 20:26:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-29 20:26:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-29 20:26:18,726 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-29 20:26:18,726 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-29 20:26:18,726 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-29 20:26:18,726 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-29 20:26:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-29 20:26:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-29 20:26:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-29 20:26:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-29 20:26:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-29 20:26:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-29 20:26:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-29 20:26:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-29 20:26:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-29 20:26:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-29 20:26:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-29 20:26:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-29 20:26:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-29 20:26:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-29 20:26:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-29 20:26:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-29 20:26:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-29 20:26:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-29 20:26:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-29 20:26:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-29 20:26:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-29 20:26:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-29 20:26:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-29 20:26:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-29 20:26:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-29 20:26:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-29 20:26:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-29 20:26:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-29 20:26:18,731 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-29 20:26:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-29 20:26:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-29 20:26:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-29 20:26:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-29 20:26:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-29 20:26:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-29 20:26:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-29 20:26:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-11-29 20:26:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-29 20:26:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-29 20:26:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 20:26:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-11-29 20:26:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2020-11-29 20:26:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-29 20:26:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 20:26:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2020-11-29 20:26:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 20:26:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2020-11-29 20:26:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-29 20:26:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-29 20:26:18,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:26:18,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:26:19,258 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-29 20:26:19,604 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:26:19,606 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-29 20:26:19,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:26:19 BoogieIcfgContainer [2020-11-29 20:26:19,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:26:19,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 20:26:19,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 20:26:19,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 20:26:19,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:26:17" (1/3) ... [2020-11-29 20:26:19,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbe73dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:26:19, skipping insertion in model container [2020-11-29 20:26:19,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:26:18" (2/3) ... [2020-11-29 20:26:19,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbe73dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:26:19, skipping insertion in model container [2020-11-29 20:26:19,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:26:19" (3/3) ... [2020-11-29 20:26:19,625 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2020-11-29 20:26:19,636 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 20:26:19,641 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2020-11-29 20:26:19,653 INFO L253 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2020-11-29 20:26:19,673 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 20:26:19,673 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-29 20:26:19,673 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 20:26:19,673 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:26:19,674 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:26:19,674 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 20:26:19,674 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:26:19,674 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 20:26:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2020-11-29 20:26:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 20:26:19,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:19,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:19,714 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash -292981799, now seen corresponding path program 1 times [2020-11-29 20:26:19,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:19,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219197639] [2020-11-29 20:26:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:19,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:19,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219197639] [2020-11-29 20:26:19,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:19,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:26:19,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475394868] [2020-11-29 20:26:19,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:26:19,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:20,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:26:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:26:20,015 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2020-11-29 20:26:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:20,516 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2020-11-29 20:26:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:26:20,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-29 20:26:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:20,528 INFO L225 Difference]: With dead ends: 117 [2020-11-29 20:26:20,529 INFO L226 Difference]: Without dead ends: 108 [2020-11-29 20:26:20,530 INFO L677 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 [2020-11-29 20:26:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-29 20:26:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2020-11-29 20:26:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-29 20:26:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2020-11-29 20:26:20,605 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 11 [2020-11-29 20:26:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:20,606 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2020-11-29 20:26:20,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:26:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2020-11-29 20:26:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 20:26:20,607 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:20,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:20,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 20:26:20,608 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:20,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash -292981798, now seen corresponding path program 1 times [2020-11-29 20:26:20,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:20,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358718454] [2020-11-29 20:26:20,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:20,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:20,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358718454] [2020-11-29 20:26:20,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:20,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:26:20,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640645415] [2020-11-29 20:26:20,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:26:20,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:26:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:26:20,758 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 4 states. [2020-11-29 20:26:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:21,107 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2020-11-29 20:26:21,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:26:21,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-29 20:26:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:21,110 INFO L225 Difference]: With dead ends: 105 [2020-11-29 20:26:21,110 INFO L226 Difference]: Without dead ends: 105 [2020-11-29 20:26:21,111 INFO L677 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 [2020-11-29 20:26:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-29 20:26:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2020-11-29 20:26:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-29 20:26:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2020-11-29 20:26:21,129 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 11 [2020-11-29 20:26:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:21,130 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2020-11-29 20:26:21,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:26:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2020-11-29 20:26:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 20:26:21,131 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:21,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:21,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 20:26:21,132 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:21,134 INFO L82 PathProgramCache]: Analyzing trace with hash -489967971, now seen corresponding path program 1 times [2020-11-29 20:26:21,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:21,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638113623] [2020-11-29 20:26:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:21,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:21,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638113623] [2020-11-29 20:26:21,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:21,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:26:21,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419585910] [2020-11-29 20:26:21,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:26:21,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:21,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:26:21,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:26:21,262 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 4 states. [2020-11-29 20:26:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:21,632 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2020-11-29 20:26:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:26:21,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-29 20:26:21,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:21,634 INFO L225 Difference]: With dead ends: 111 [2020-11-29 20:26:21,635 INFO L226 Difference]: Without dead ends: 111 [2020-11-29 20:26:21,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:26:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-29 20:26:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2020-11-29 20:26:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-29 20:26:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2020-11-29 20:26:21,645 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 15 [2020-11-29 20:26:21,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:21,645 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2020-11-29 20:26:21,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:26:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2020-11-29 20:26:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 20:26:21,646 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:21,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:21,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 20:26:21,647 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:21,648 INFO L82 PathProgramCache]: Analyzing trace with hash -432106002, now seen corresponding path program 1 times [2020-11-29 20:26:21,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:21,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856815934] [2020-11-29 20:26:21,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:21,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:21,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:21,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856815934] [2020-11-29 20:26:21,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:21,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 20:26:21,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144474097] [2020-11-29 20:26:21,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:26:21,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:21,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:26:21,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:26:21,800 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 7 states. [2020-11-29 20:26:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:22,305 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2020-11-29 20:26:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 20:26:22,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-11-29 20:26:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:22,307 INFO L225 Difference]: With dead ends: 99 [2020-11-29 20:26:22,307 INFO L226 Difference]: Without dead ends: 96 [2020-11-29 20:26:22,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-29 20:26:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-29 20:26:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2020-11-29 20:26:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-29 20:26:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2020-11-29 20:26:22,317 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 18 [2020-11-29 20:26:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:22,317 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2020-11-29 20:26:22,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:26:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2020-11-29 20:26:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 20:26:22,318 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:22,319 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:22,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 20:26:22,319 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash 523815401, now seen corresponding path program 1 times [2020-11-29 20:26:22,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:22,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938959688] [2020-11-29 20:26:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:22,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:22,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938959688] [2020-11-29 20:26:22,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426873649] [2020-11-29 20:26:22,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:22,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 20:26:22,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:22,687 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 20:26:22,687 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:22,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:22,706 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:22,706 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-29 20:26:22,757 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:22,758 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-11-29 20:26:22,759 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:22,800 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-29 20:26:22,800 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:22,800 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-11-29 20:26:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:22,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:26:22,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-11-29 20:26:22,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468079109] [2020-11-29 20:26:22,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:26:22,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:26:22,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:26:22,827 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 7 states. [2020-11-29 20:26:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:23,237 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2020-11-29 20:26:23,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:26:23,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-11-29 20:26:23,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:23,239 INFO L225 Difference]: With dead ends: 95 [2020-11-29 20:26:23,240 INFO L226 Difference]: Without dead ends: 95 [2020-11-29 20:26:23,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:26:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-29 20:26:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2020-11-29 20:26:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-29 20:26:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2020-11-29 20:26:23,248 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 22 [2020-11-29 20:26:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:23,248 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2020-11-29 20:26:23,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:26:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2020-11-29 20:26:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 20:26:23,249 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:23,250 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:23,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:26:23,473 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:23,473 INFO L82 PathProgramCache]: Analyzing trace with hash 523815402, now seen corresponding path program 1 times [2020-11-29 20:26:23,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:23,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320958340] [2020-11-29 20:26:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:23,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:23,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320958340] [2020-11-29 20:26:23,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224973839] [2020-11-29 20:26:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:23,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 20:26:23,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:23,887 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 20:26:23,887 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:23,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:23,897 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:23,897 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:26:23,959 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:23,959 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-11-29 20:26:23,960 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:23,981 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-29 20:26:23,983 INFO L545 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. [2020-11-29 20:26:23,983 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2020-11-29 20:26:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:23,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:26:23,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-11-29 20:26:23,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214640692] [2020-11-29 20:26:23,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 20:26:23,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:24,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 20:26:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-29 20:26:24,000 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 8 states. [2020-11-29 20:26:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:24,424 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2020-11-29 20:26:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:26:24,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-29 20:26:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:24,425 INFO L225 Difference]: With dead ends: 94 [2020-11-29 20:26:24,425 INFO L226 Difference]: Without dead ends: 94 [2020-11-29 20:26:24,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:26:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-29 20:26:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2020-11-29 20:26:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-29 20:26:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2020-11-29 20:26:24,436 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 22 [2020-11-29 20:26:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:24,437 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2020-11-29 20:26:24,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 20:26:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2020-11-29 20:26:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 20:26:24,439 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:24,439 INFO L422 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] [2020-11-29 20:26:24,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:26:24,645 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1021696222, now seen corresponding path program 1 times [2020-11-29 20:26:24,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:24,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495514639] [2020-11-29 20:26:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:24,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:24,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:24,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495514639] [2020-11-29 20:26:24,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461183251] [2020-11-29 20:26:24,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:24,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:26:24,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:25,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:26:25,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2020-11-29 20:26:25,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631224869] [2020-11-29 20:26:25,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 20:26:25,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 20:26:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-29 20:26:25,032 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 10 states. [2020-11-29 20:26:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:25,625 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2020-11-29 20:26:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:26:25,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-11-29 20:26:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:25,627 INFO L225 Difference]: With dead ends: 105 [2020-11-29 20:26:25,627 INFO L226 Difference]: Without dead ends: 102 [2020-11-29 20:26:25,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-11-29 20:26:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-29 20:26:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2020-11-29 20:26:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-29 20:26:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2020-11-29 20:26:25,640 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 25 [2020-11-29 20:26:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:25,641 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2020-11-29 20:26:25,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 20:26:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2020-11-29 20:26:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-29 20:26:25,643 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:25,643 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:26:25,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:26:25,844 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:25,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1845924718, now seen corresponding path program 2 times [2020-11-29 20:26:25,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:25,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053738117] [2020-11-29 20:26:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:25,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:25,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:26,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053738117] [2020-11-29 20:26:26,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312313707] [2020-11-29 20:26:26,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:26,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-11-29 20:26:26,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:26:26,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 20:26:26,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-29 20:26:26,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:26:26,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2020-11-29 20:26:26,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457624048] [2020-11-29 20:26:26,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:26:26,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:26,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:26:26,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-29 20:26:26,293 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 6 states. [2020-11-29 20:26:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:26,375 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-11-29 20:26:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:26:26,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-11-29 20:26:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:26,377 INFO L225 Difference]: With dead ends: 77 [2020-11-29 20:26:26,377 INFO L226 Difference]: Without dead ends: 77 [2020-11-29 20:26:26,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:26:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-29 20:26:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-11-29 20:26:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-29 20:26:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2020-11-29 20:26:26,381 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 32 [2020-11-29 20:26:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:26,382 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2020-11-29 20:26:26,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:26:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2020-11-29 20:26:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-29 20:26:26,383 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:26,383 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:26:26,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:26:26,604 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1845924773, now seen corresponding path program 1 times [2020-11-29 20:26:26,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:26,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934641301] [2020-11-29 20:26:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:26,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:26,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:26,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934641301] [2020-11-29 20:26:26,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926836656] [2020-11-29 20:26:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:26,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 20:26:26,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:26,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:26:26,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2020-11-29 20:26:26,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435709350] [2020-11-29 20:26:26,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:26:26,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:26:26,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:26:26,990 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 7 states. [2020-11-29 20:26:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:27,345 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2020-11-29 20:26:27,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:26:27,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-11-29 20:26:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:27,347 INFO L225 Difference]: With dead ends: 85 [2020-11-29 20:26:27,347 INFO L226 Difference]: Without dead ends: 85 [2020-11-29 20:26:27,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-29 20:26:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-29 20:26:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2020-11-29 20:26:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-29 20:26:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2020-11-29 20:26:27,353 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 32 [2020-11-29 20:26:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:27,353 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2020-11-29 20:26:27,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:26:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2020-11-29 20:26:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-29 20:26:27,355 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:27,355 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:27,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:26:27,576 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:27,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1941880083, now seen corresponding path program 1 times [2020-11-29 20:26:27,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:27,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385486420] [2020-11-29 20:26:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:27,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:27,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 20:26:27,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385486420] [2020-11-29 20:26:27,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:27,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 20:26:27,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105027613] [2020-11-29 20:26:27,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 20:26:27,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 20:26:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-29 20:26:27,816 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 11 states. [2020-11-29 20:26:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:28,421 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2020-11-29 20:26:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:26:28,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2020-11-29 20:26:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:28,423 INFO L225 Difference]: With dead ends: 94 [2020-11-29 20:26:28,423 INFO L226 Difference]: Without dead ends: 94 [2020-11-29 20:26:28,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-11-29 20:26:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-29 20:26:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2020-11-29 20:26:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-29 20:26:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2020-11-29 20:26:28,430 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 33 [2020-11-29 20:26:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:28,431 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2020-11-29 20:26:28,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 20:26:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2020-11-29 20:26:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-29 20:26:28,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:28,436 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:28,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 20:26:28,437 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1941880082, now seen corresponding path program 1 times [2020-11-29 20:26:28,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:28,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755703201] [2020-11-29 20:26:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:28,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:28,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:26:28,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755703201] [2020-11-29 20:26:28,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:28,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 20:26:28,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245865907] [2020-11-29 20:26:28,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 20:26:28,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 20:26:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-29 20:26:28,718 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 11 states. [2020-11-29 20:26:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:29,431 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2020-11-29 20:26:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 20:26:29,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2020-11-29 20:26:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:29,433 INFO L225 Difference]: With dead ends: 93 [2020-11-29 20:26:29,433 INFO L226 Difference]: Without dead ends: 93 [2020-11-29 20:26:29,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-11-29 20:26:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-29 20:26:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2020-11-29 20:26:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-29 20:26:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2020-11-29 20:26:29,437 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 33 [2020-11-29 20:26:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:29,437 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2020-11-29 20:26:29,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 20:26:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2020-11-29 20:26:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:26:29,438 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:29,438 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:29,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 20:26:29,439 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:29,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:29,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1634979459, now seen corresponding path program 1 times [2020-11-29 20:26:29,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:29,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793946961] [2020-11-29 20:26:29,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:29,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:29,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:29,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793946961] [2020-11-29 20:26:29,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490205480] [2020-11-29 20:26:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:30,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 54 conjunts are in the unsatisfiable core [2020-11-29 20:26:30,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:30,145 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 20:26:30,145 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,165 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:30,165 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:26:30,228 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:30,228 INFO L384 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 [2020-11-29 20:26:30,229 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:30,231 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,231 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-11-29 20:26:30,256 INFO L384 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 [2020-11-29 20:26:30,257 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:30,267 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,268 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-11-29 20:26:30,329 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-29 20:26:30,330 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2020-11-29 20:26:30,330 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:30,336 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,337 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2020-11-29 20:26:30,441 INFO L350 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2020-11-29 20:26:30,442 INFO L384 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 56 treesize of output 111 [2020-11-29 20:26:30,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-11-29 20:26:30,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:26:30,446 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,472 INFO L625 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2020-11-29 20:26:30,473 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:26:30,473 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2020-11-29 20:26:30,948 INFO L350 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2020-11-29 20:26:30,948 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 54 [2020-11-29 20:26:30,950 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,965 INFO L625 ElimStorePlain]: treesize reduction 16, result has 38.5 percent of original size [2020-11-29 20:26:30,967 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:30,967 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:5 [2020-11-29 20:26:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:30,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:26:30,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2020-11-29 20:26:30,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888205503] [2020-11-29 20:26:30,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-29 20:26:30,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-29 20:26:30,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=695, Unknown=0, NotChecked=0, Total=756 [2020-11-29 20:26:30,975 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 28 states. [2020-11-29 20:26:32,749 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2020-11-29 20:26:33,005 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2020-11-29 20:26:33,177 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-11-29 20:26:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:33,942 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2020-11-29 20:26:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-29 20:26:33,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2020-11-29 20:26:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:33,943 INFO L225 Difference]: With dead ends: 106 [2020-11-29 20:26:33,943 INFO L226 Difference]: Without dead ends: 106 [2020-11-29 20:26:33,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=282, Invalid=2070, Unknown=0, NotChecked=0, Total=2352 [2020-11-29 20:26:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-29 20:26:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2020-11-29 20:26:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-29 20:26:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2020-11-29 20:26:33,953 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 36 [2020-11-29 20:26:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:33,953 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2020-11-29 20:26:33,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-29 20:26:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2020-11-29 20:26:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 20:26:33,957 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:33,957 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:34,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:26:34,168 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:34,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1634979458, now seen corresponding path program 1 times [2020-11-29 20:26:34,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:34,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037682323] [2020-11-29 20:26:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:34,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:34,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:34,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037682323] [2020-11-29 20:26:34,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802381428] [2020-11-29 20:26:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:34,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 59 conjunts are in the unsatisfiable core [2020-11-29 20:26:34,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:34,879 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 20:26:34,880 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:34,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:34,884 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:34,884 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 20:26:34,993 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:34,993 INFO L384 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 [2020-11-29 20:26:34,993 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:34,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:34,997 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:34,998 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-11-29 20:26:35,036 INFO L384 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 [2020-11-29 20:26:35,037 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:35,048 INFO L384 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 [2020-11-29 20:26:35,048 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:35,055 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,055 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-11-29 20:26:35,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:26:35,096 INFO L384 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 23 treesize of output 22 [2020-11-29 20:26:35,096 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:35,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:26:35,112 INFO L384 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 23 treesize of output 22 [2020-11-29 20:26:35,112 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:35,123 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,123 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2020-11-29 20:26:35,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:26:35,310 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-29 20:26:35,310 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:35,311 INFO L384 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 101 treesize of output 168 [2020-11-29 20:26:35,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-29 20:26:35,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:26:35,315 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,360 INFO L625 ElimStorePlain]: treesize reduction 58, result has 65.3 percent of original size [2020-11-29 20:26:35,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:26:35,368 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 71 [2020-11-29 20:26:35,369 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:35,382 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,382 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:99 [2020-11-29 20:26:35,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:26:35,824 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:35,824 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 89 [2020-11-29 20:26:35,825 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,858 INFO L625 ElimStorePlain]: treesize reduction 22, result has 73.2 percent of original size [2020-11-29 20:26:35,865 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-29 20:26:35,865 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 25 [2020-11-29 20:26:35,869 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:35,877 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:35,877 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:11 [2020-11-29 20:26:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:26:35,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:26:35,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2020-11-29 20:26:35,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971557485] [2020-11-29 20:26:35,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-11-29 20:26:35,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:35,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-11-29 20:26:35,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2020-11-29 20:26:35,963 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 33 states. [2020-11-29 20:26:36,834 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2020-11-29 20:26:37,189 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2020-11-29 20:26:38,163 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2020-11-29 20:26:38,489 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2020-11-29 20:26:38,648 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2020-11-29 20:26:39,226 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2020-11-29 20:26:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:39,648 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2020-11-29 20:26:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-29 20:26:39,648 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2020-11-29 20:26:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:39,649 INFO L225 Difference]: With dead ends: 135 [2020-11-29 20:26:39,649 INFO L226 Difference]: Without dead ends: 135 [2020-11-29 20:26:39,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=317, Invalid=2439, Unknown=0, NotChecked=0, Total=2756 [2020-11-29 20:26:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-29 20:26:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2020-11-29 20:26:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-29 20:26:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2020-11-29 20:26:39,657 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 36 [2020-11-29 20:26:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:39,657 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2020-11-29 20:26:39,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-11-29 20:26:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2020-11-29 20:26:39,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 20:26:39,658 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:39,658 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:26:39,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:26:39,872 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:39,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1552742742, now seen corresponding path program 2 times [2020-11-29 20:26:39,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:39,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627836326] [2020-11-29 20:26:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:39,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:39,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-29 20:26:40,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627836326] [2020-11-29 20:26:40,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:40,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 20:26:40,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507440521] [2020-11-29 20:26:40,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 20:26:40,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 20:26:40,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:26:40,008 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 9 states. [2020-11-29 20:26:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:40,368 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-11-29 20:26:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:26:40,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2020-11-29 20:26:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:40,370 INFO L225 Difference]: With dead ends: 84 [2020-11-29 20:26:40,370 INFO L226 Difference]: Without dead ends: 84 [2020-11-29 20:26:40,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-11-29 20:26:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-29 20:26:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2020-11-29 20:26:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-29 20:26:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-11-29 20:26:40,377 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 39 [2020-11-29 20:26:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:40,377 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-11-29 20:26:40,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 20:26:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-11-29 20:26:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-29 20:26:40,378 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:40,378 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:40,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 20:26:40,379 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:40,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:40,379 INFO L82 PathProgramCache]: Analyzing trace with hash -617815296, now seen corresponding path program 1 times [2020-11-29 20:26:40,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:40,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077372075] [2020-11-29 20:26:40,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:40,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:40,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:40,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:26:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 20:26:40,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077372075] [2020-11-29 20:26:40,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:40,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 20:26:40,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101882787] [2020-11-29 20:26:40,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 20:26:40,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:40,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 20:26:40,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:26:40,583 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 12 states. [2020-11-29 20:26:41,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:41,179 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2020-11-29 20:26:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 20:26:41,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-11-29 20:26:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:41,180 INFO L225 Difference]: With dead ends: 84 [2020-11-29 20:26:41,181 INFO L226 Difference]: Without dead ends: 84 [2020-11-29 20:26:41,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2020-11-29 20:26:41,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-29 20:26:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2020-11-29 20:26:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-29 20:26:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2020-11-29 20:26:41,184 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 46 [2020-11-29 20:26:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:41,185 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2020-11-29 20:26:41,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 20:26:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2020-11-29 20:26:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-29 20:26:41,185 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:41,186 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:26:41,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 20:26:41,186 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:41,186 INFO L82 PathProgramCache]: Analyzing trace with hash -617815295, now seen corresponding path program 1 times [2020-11-29 20:26:41,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:41,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76751617] [2020-11-29 20:26:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:41,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:41,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:41,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:26:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 20:26:41,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76751617] [2020-11-29 20:26:41,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458609477] [2020-11-29 20:26:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:41,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 20:26:41,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 20:26:41,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:26:41,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2020-11-29 20:26:41,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051028993] [2020-11-29 20:26:41,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 20:26:41,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 20:26:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:26:41,541 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 9 states. [2020-11-29 20:26:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:41,817 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2020-11-29 20:26:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 20:26:41,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2020-11-29 20:26:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:41,818 INFO L225 Difference]: With dead ends: 83 [2020-11-29 20:26:41,818 INFO L226 Difference]: Without dead ends: 83 [2020-11-29 20:26:41,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:26:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-29 20:26:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2020-11-29 20:26:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-29 20:26:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2020-11-29 20:26:41,822 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 46 [2020-11-29 20:26:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:41,823 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2020-11-29 20:26:41,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 20:26:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-11-29 20:26:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-29 20:26:41,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:41,824 INFO L422 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] [2020-11-29 20:26:42,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-29 20:26:42,036 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:42,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:42,037 INFO L82 PathProgramCache]: Analyzing trace with hash -286334814, now seen corresponding path program 1 times [2020-11-29 20:26:42,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:42,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471039629] [2020-11-29 20:26:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:26:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 20:26:42,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471039629] [2020-11-29 20:26:42,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238840739] [2020-11-29 20:26:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 20:26:42,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 20:26:42,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:26:42,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 11 [2020-11-29 20:26:42,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81843190] [2020-11-29 20:26:42,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:26:42,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:42,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:26:42,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-29 20:26:42,416 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 7 states. [2020-11-29 20:26:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:42,481 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-11-29 20:26:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 20:26:42,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2020-11-29 20:26:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:42,482 INFO L225 Difference]: With dead ends: 69 [2020-11-29 20:26:42,483 INFO L226 Difference]: Without dead ends: 69 [2020-11-29 20:26:42,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-11-29 20:26:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-29 20:26:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-29 20:26:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-29 20:26:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-11-29 20:26:42,486 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 47 [2020-11-29 20:26:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:42,486 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-11-29 20:26:42,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:26:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-11-29 20:26:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-29 20:26:42,487 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:42,487 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:26:42,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-11-29 20:26:42,704 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:42,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash 268594741, now seen corresponding path program 2 times [2020-11-29 20:26:42,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:42,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812580376] [2020-11-29 20:26:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:26:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-29 20:26:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 20:26:42,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812580376] [2020-11-29 20:26:42,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:42,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 20:26:42,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136522116] [2020-11-29 20:26:42,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 20:26:42,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:42,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 20:26:42,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:26:42,947 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 12 states. [2020-11-29 20:26:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:43,510 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-11-29 20:26:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 20:26:43,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2020-11-29 20:26:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:43,511 INFO L225 Difference]: With dead ends: 76 [2020-11-29 20:26:43,511 INFO L226 Difference]: Without dead ends: 76 [2020-11-29 20:26:43,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-11-29 20:26:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-29 20:26:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2020-11-29 20:26:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-29 20:26:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-11-29 20:26:43,515 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 54 [2020-11-29 20:26:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:43,515 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-11-29 20:26:43,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 20:26:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-11-29 20:26:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-29 20:26:43,516 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:43,516 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:26:43,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 20:26:43,517 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash 180537005, now seen corresponding path program 1 times [2020-11-29 20:26:43,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:43,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527464413] [2020-11-29 20:26:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:43,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:43,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:43,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:26:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:43,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-29 20:26:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:43,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-29 20:26:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 20:26:43,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527464413] [2020-11-29 20:26:43,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:43,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-29 20:26:43,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341032378] [2020-11-29 20:26:43,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-29 20:26:43,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:43,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 20:26:43,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-11-29 20:26:43,765 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 13 states. [2020-11-29 20:26:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:44,208 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2020-11-29 20:26:44,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 20:26:44,209 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2020-11-29 20:26:44,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:44,209 INFO L225 Difference]: With dead ends: 76 [2020-11-29 20:26:44,209 INFO L226 Difference]: Without dead ends: 74 [2020-11-29 20:26:44,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2020-11-29 20:26:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-29 20:26:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2020-11-29 20:26:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-29 20:26:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-11-29 20:26:44,212 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 57 [2020-11-29 20:26:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:44,212 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-11-29 20:26:44,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-29 20:26:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2020-11-29 20:26:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-29 20:26:44,213 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:44,213 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:26:44,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 20:26:44,214 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 181819012, now seen corresponding path program 1 times [2020-11-29 20:26:44,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:44,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990244776] [2020-11-29 20:26:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:44,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:44,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:44,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:26:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:44,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-29 20:26:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 20:26:44,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990244776] [2020-11-29 20:26:44,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:26:44,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-29 20:26:44,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332204217] [2020-11-29 20:26:44,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 20:26:44,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:26:44,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 20:26:44,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:26:44,470 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 12 states. [2020-11-29 20:26:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:26:44,996 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-11-29 20:26:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 20:26:44,997 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2020-11-29 20:26:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:26:44,997 INFO L225 Difference]: With dead ends: 73 [2020-11-29 20:26:44,997 INFO L226 Difference]: Without dead ends: 73 [2020-11-29 20:26:44,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2020-11-29 20:26:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-29 20:26:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2020-11-29 20:26:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-29 20:26:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2020-11-29 20:26:45,001 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 57 [2020-11-29 20:26:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:26:45,001 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2020-11-29 20:26:45,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 20:26:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2020-11-29 20:26:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-29 20:26:45,002 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:26:45,002 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:26:45,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 20:26:45,002 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:26:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:26:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash 616483513, now seen corresponding path program 1 times [2020-11-29 20:26:45,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:26:45,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135086103] [2020-11-29 20:26:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:26:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:45,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:26:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:45,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:26:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:45,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:26:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:45,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-29 20:26:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-29 20:26:45,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135086103] [2020-11-29 20:26:45,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650318879] [2020-11-29 20:26:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:26:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:26:46,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 80 conjunts are in the unsatisfiable core [2020-11-29 20:26:46,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:26:46,150 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:46,151 INFO L384 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 [2020-11-29 20:26:46,151 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:46,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:46,156 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:46,156 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-11-29 20:26:46,205 INFO L384 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 [2020-11-29 20:26:46,205 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:46,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:46,210 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:46,210 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-11-29 20:26:46,245 INFO L384 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 28 treesize of output 23 [2020-11-29 20:26:46,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:26:46,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:26:46,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:26:46,256 INFO L384 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 18 treesize of output 22 [2020-11-29 20:26:46,257 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:46,262 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:46,263 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:46,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:46,273 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:26:46,273 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:26 [2020-11-29 20:26:46,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:26:46,382 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:46,382 INFO L384 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 3 case distinctions, treesize of input 56 treesize of output 111 [2020-11-29 20:26:46,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-11-29 20:26:46,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:26:46,385 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:26:46,419 INFO L625 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2020-11-29 20:26:46,419 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:26:46,420 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2020-11-29 20:26:46,848 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:26:46,849 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 47 [2020-11-29 20:26:46,850 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:26:46,853 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:26:46,854 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:26:46,866 INFO L625 ElimStorePlain]: treesize reduction 14, result has 48.1 percent of original size [2020-11-29 20:26:46,867 INFO L545 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. [2020-11-29 20:26:46,867 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:9 [2020-11-29 20:27:23,278 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-29 20:27:23,311 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:27:23,402 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:27:23,402 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 236 [2020-11-29 20:27:23,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 1] term [2020-11-29 20:27:23,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-11-29 20:27:23,406 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:27:23,454 INFO L625 ElimStorePlain]: treesize reduction 173, result has 23.1 percent of original size [2020-11-29 20:27:23,455 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:27:23,456 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:33 [2020-11-29 20:27:25,550 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:27:25,551 INFO L384 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 25 treesize of output 13 [2020-11-29 20:27:25,555 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:27:25,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:27:25,562 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:27:25,562 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-11-29 20:28:04,014 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 21 [2020-11-29 20:28:04,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:28:04,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:28:04,063 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:28:04,063 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2020-11-29 20:28:04,064 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:28:04,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:28:04,075 INFO L545 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. [2020-11-29 20:28:04,075 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:30 [2020-11-29 20:28:10,259 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:28:10,259 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2020-11-29 20:28:10,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:28:10,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:28:10,263 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:28:10,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:28:10,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:28:10,279 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:28:10,279 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2020-11-29 20:28:10,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:28:12,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:28:16,604 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2020-11-29 20:28:16,605 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:28:16,614 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-11-29 20:28:16,614 INFO L545 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. [2020-11-29 20:28:16,615 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2020-11-29 20:28:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 16 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 20:28:18,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:28:18,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 46 [2020-11-29 20:28:18,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913045969] [2020-11-29 20:28:18,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2020-11-29 20:28:18,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:28:18,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2020-11-29 20:28:18,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1976, Unknown=46, NotChecked=0, Total=2162 [2020-11-29 20:28:18,413 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 47 states. [2020-11-29 20:29:34,785 WARN L193 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-11-29 20:29:50,986 WARN L193 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-11-29 20:30:01,748 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2020-11-29 20:30:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:30:04,314 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2020-11-29 20:30:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-29 20:30:04,314 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 60 [2020-11-29 20:30:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:30:04,315 INFO L225 Difference]: With dead ends: 91 [2020-11-29 20:30:04,315 INFO L226 Difference]: Without dead ends: 91 [2020-11-29 20:30:04,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 130.4s TimeCoverageRelationStatistics Valid=473, Invalid=4869, Unknown=60, NotChecked=0, Total=5402 [2020-11-29 20:30:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-29 20:30:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2020-11-29 20:30:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-29 20:30:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2020-11-29 20:30:04,321 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 60 [2020-11-29 20:30:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:30:04,321 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2020-11-29 20:30:04,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2020-11-29 20:30:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-11-29 20:30:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-29 20:30:04,322 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:30:04,322 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:30:04,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:30:04,532 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:30:04,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:30:04,533 INFO L82 PathProgramCache]: Analyzing trace with hash 616483514, now seen corresponding path program 1 times [2020-11-29 20:30:04,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:30:04,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362319854] [2020-11-29 20:30:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:30:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:30:04,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:30:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:30:04,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:30:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:30:05,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:30:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:30:05,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-29 20:30:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:30:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 20:30:05,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362319854] [2020-11-29 20:30:05,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896426536] [2020-11-29 20:30:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:30:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:30:05,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 93 conjunts are in the unsatisfiable core [2020-11-29 20:30:05,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:30:05,855 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:05,856 INFO L384 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 [2020-11-29 20:30:05,856 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:05,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:05,861 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:30:05,861 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-29 20:30:05,937 INFO L384 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 [2020-11-29 20:30:05,937 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:05,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:05,951 INFO L384 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 [2020-11-29 20:30:05,951 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:05,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:05,962 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:30:05,962 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2020-11-29 20:30:06,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:06,016 INFO L384 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 23 treesize of output 22 [2020-11-29 20:30:06,017 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:06,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:06,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:06,051 INFO L384 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 23 treesize of output 22 [2020-11-29 20:30:06,051 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:06,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:06,070 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:30:06,071 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2020-11-29 20:30:06,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:06,141 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 81 [2020-11-29 20:30:06,141 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:06,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:06,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:06,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:06,182 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:06,183 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 118 [2020-11-29 20:30:06,183 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:06,274 INFO L625 ElimStorePlain]: treesize reduction 58, result has 64.4 percent of original size [2020-11-29 20:30:06,274 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:30:06,274 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:105 [2020-11-29 20:30:06,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:06,651 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 43 [2020-11-29 20:30:06,655 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:30:06,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:06,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:06,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:06,726 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:06,726 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 35 [2020-11-29 20:30:06,728 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:30:06,729 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:30:06,729 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:30:06,769 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2020-11-29 20:30:06,772 INFO L545 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. [2020-11-29 20:30:06,772 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:12 [2020-11-29 20:30:32,462 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 32 [2020-11-29 20:30:32,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:32,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:32,593 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:32,593 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 235 [2020-11-29 20:30:32,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 1] term [2020-11-29 20:30:32,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-11-29 20:30:32,596 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:32,699 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-11-29 20:30:32,700 INFO L625 ElimStorePlain]: treesize reduction 160, result has 49.2 percent of original size [2020-11-29 20:30:32,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:32,722 INFO L350 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2020-11-29 20:30:32,722 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 84 [2020-11-29 20:30:32,723 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:32,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:32,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-11-29 20:30:32,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:32,807 INFO L545 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. [2020-11-29 20:30:32,807 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:176, output treesize:68 [2020-11-29 20:30:32,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:32,950 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2020-11-29 20:30:32,952 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:30:32,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:32,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:32,976 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2020-11-29 20:30:32,979 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:32,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:32,995 INFO L545 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. [2020-11-29 20:30:32,995 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:12 [2020-11-29 20:30:35,293 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_58 Int)) (<= 12 (select |c_#length| v_arrayElimCell_58))) (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.offset| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset))) |c_#memory_$Pointer$.base|)))) is different from true [2020-11-29 20:30:35,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:35,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:35,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:35,352 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2020-11-29 20:30:35,353 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:35,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:35,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:35,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:35,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:35,410 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2020-11-29 20:30:35,411 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:35,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:35,447 INFO L545 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. [2020-11-29 20:30:35,448 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:101, output treesize:68 [2020-11-29 20:30:35,980 INFO L384 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 [2020-11-29 20:30:35,982 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:36,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:36,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:36,056 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:36,056 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 48 [2020-11-29 20:30:36,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:30:36,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:30:36,060 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:30:36,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:36,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:30:36,132 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:36,133 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2020-11-29 20:30:36,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:30:36,134 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:30:36,177 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:30:36,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:30:36,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:30:36,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:30:36,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,211 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 20:30:36,211 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:69 [2020-11-29 20:30:36,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:30:36,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:30:36,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:30:36,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:30:36,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:30:36,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:30:36,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:36,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:30:37,114 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2020-11-29 20:30:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2020-11-29 20:30:37,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:30:37,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 52 [2020-11-29 20:30:37,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351985673] [2020-11-29 20:30:37,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 53 states [2020-11-29 20:30:37,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:30:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2020-11-29 20:30:37,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2485, Unknown=12, NotChecked=100, Total=2756 [2020-11-29 20:30:37,303 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 53 states. [2020-11-29 20:31:05,947 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2020-11-29 20:31:08,653 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2020-11-29 20:31:15,316 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2020-11-29 20:31:22,189 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-11-29 20:31:26,976 WARN L193 SmtUtils]: Spent 4.17 s on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 20:31:37,716 WARN L193 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2020-11-29 20:31:42,655 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2020-11-29 20:31:43,031 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2020-11-29 20:31:43,396 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2020-11-29 20:31:43,725 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2020-11-29 20:31:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:46,757 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2020-11-29 20:31:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-29 20:31:46,759 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 60 [2020-11-29 20:31:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:46,760 INFO L225 Difference]: With dead ends: 89 [2020-11-29 20:31:46,760 INFO L226 Difference]: Without dead ends: 89 [2020-11-29 20:31:46,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=580, Invalid=6217, Unknown=13, NotChecked=162, Total=6972 [2020-11-29 20:31:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-29 20:31:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2020-11-29 20:31:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-29 20:31:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2020-11-29 20:31:46,764 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 60 [2020-11-29 20:31:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:46,765 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2020-11-29 20:31:46,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2020-11-29 20:31:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2020-11-29 20:31:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 20:31:46,765 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:46,765 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:31:46,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-11-29 20:31:46,966 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:31:46,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:46,966 INFO L82 PathProgramCache]: Analyzing trace with hash 378888200, now seen corresponding path program 1 times [2020-11-29 20:31:46,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:46,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149614772] [2020-11-29 20:31:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:47,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:31:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:47,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:31:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:47,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:31:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:47,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-29 20:31:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:47,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-29 20:31:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 20:31:47,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149614772] [2020-11-29 20:31:47,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356426077] [2020-11-29 20:31:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:31:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:48,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2020-11-29 20:31:48,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:31:48,308 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:31:48,308 INFO L384 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 [2020-11-29 20:31:48,309 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:31:48,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:31:48,321 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:31:48,321 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-11-29 20:31:48,461 INFO L384 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 [2020-11-29 20:31:48,461 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:31:48,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:31:48,476 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:31:48,477 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2020-11-29 20:31:48,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:31:48,556 INFO L384 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 23 treesize of output 22 [2020-11-29 20:31:48,556 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:31:48,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:31:48,570 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:31:48,570 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2020-11-29 20:31:48,775 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:31:48,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:31:48,805 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:31:48,806 INFO L384 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 55 treesize of output 60 [2020-11-29 20:31:48,806 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:31:48,857 INFO L625 ElimStorePlain]: treesize reduction 40, result has 54.0 percent of original size [2020-11-29 20:31:48,858 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:31:48,858 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:47 [2020-11-29 20:31:51,714 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (+ |c_dll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) dll_update_at_~head.offset)))))) is different from true [2020-11-29 20:31:51,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:31:51,730 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:31:51,818 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:31:51,819 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 154 [2020-11-29 20:31:51,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-29 20:31:51,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:31:51,822 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:31:51,912 INFO L625 ElimStorePlain]: treesize reduction 124, result has 33.7 percent of original size [2020-11-29 20:31:51,914 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:31:51,915 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:36 [2020-11-29 20:31:54,050 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2020-11-29 20:31:54,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:31:54,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:31:54,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:31:54,077 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:31:54,078 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 30 [2020-11-29 20:31:54,078 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:31:54,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:31:54,097 INFO L545 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. [2020-11-29 20:31:54,097 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:36 [2020-11-29 20:31:54,485 INFO L384 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 [2020-11-29 20:31:54,486 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:31:54,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:31:54,508 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 20:31:54,508 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2020-11-29 20:31:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2020-11-29 20:31:55,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:31:55,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2020-11-29 20:31:55,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516870991] [2020-11-29 20:31:55,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 58 states [2020-11-29 20:31:55,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:55,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2020-11-29 20:31:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2870, Unknown=2, NotChecked=218, Total=3306 [2020-11-29 20:31:55,005 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 58 states. [2020-11-29 20:32:01,728 WARN L193 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-11-29 20:32:05,962 WARN L193 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-11-29 20:32:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:32:07,218 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2020-11-29 20:32:07,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-29 20:32:07,219 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 63 [2020-11-29 20:32:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:32:07,219 INFO L225 Difference]: With dead ends: 89 [2020-11-29 20:32:07,220 INFO L226 Difference]: Without dead ends: 87 [2020-11-29 20:32:07,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=708, Invalid=6780, Unknown=2, NotChecked=342, Total=7832 [2020-11-29 20:32:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-29 20:32:07,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2020-11-29 20:32:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-29 20:32:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2020-11-29 20:32:07,226 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 63 [2020-11-29 20:32:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:32:07,226 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2020-11-29 20:32:07,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2020-11-29 20:32:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2020-11-29 20:32:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 20:32:07,227 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:32:07,227 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-29 20:32:07,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:32:07,428 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:32:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:32:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash 380170207, now seen corresponding path program 1 times [2020-11-29 20:32:07,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:32:07,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166560579] [2020-11-29 20:32:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:32:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:07,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:32:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:07,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:32:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:07,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:32:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:08,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-29 20:32:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 20:32:08,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166560579] [2020-11-29 20:32:08,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027490205] [2020-11-29 20:32:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:32:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:08,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 74 conjunts are in the unsatisfiable core [2020-11-29 20:32:08,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:32:08,726 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:08,726 INFO L384 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 [2020-11-29 20:32:08,727 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:08,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:08,740 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:08,741 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2020-11-29 20:32:08,920 INFO L384 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 [2020-11-29 20:32:08,920 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:08,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:08,945 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:08,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-11-29 20:32:09,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:09,052 INFO L384 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 23 treesize of output 22 [2020-11-29 20:32:09,053 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:09,069 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:09,069 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:09,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2020-11-29 20:32:09,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:09,226 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:09,226 INFO L384 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 56 treesize of output 111 [2020-11-29 20:32:09,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-11-29 20:32:09,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:09,228 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:09,274 INFO L625 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2020-11-29 20:32:09,275 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:32:09,275 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:55 [2020-11-29 20:32:09,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:09,777 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:09,778 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2020-11-29 20:32:09,778 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:32:09,781 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:09,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:09,794 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:09,794 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:3 [2020-11-29 20:32:11,990 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (+ |c_dll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) dll_update_at_~head.offset)))))) is different from true [2020-11-29 20:32:12,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:12,095 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:12,095 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 183 [2020-11-29 20:32:12,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-11-29 20:32:12,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:12,097 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:12,194 INFO L625 ElimStorePlain]: treesize reduction 142, result has 30.0 percent of original size [2020-11-29 20:32:12,198 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:12,199 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:40 [2020-11-29 20:32:12,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:12,297 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2020-11-29 20:32:12,299 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:12,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:12,312 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:12,312 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:3 [2020-11-29 20:32:14,426 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2020-11-29 20:32:14,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:14,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:14,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:14,467 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2020-11-29 20:32:14,468 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:14,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:14,485 INFO L545 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. [2020-11-29 20:32:14,485 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:40 [2020-11-29 20:32:14,755 INFO L384 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 [2020-11-29 20:32:14,775 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:14,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:14,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:14,838 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:14,839 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2020-11-29 20:32:14,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:14,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:14,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:14,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:14,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:14,857 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-29 20:32:14,936 INFO L625 ElimStorePlain]: treesize reduction 15, result has 78.6 percent of original size [2020-11-29 20:32:14,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:14,945 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 20:32:14,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:14,956 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 20:32:14,958 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2020-11-29 20:32:14,958 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:59 [2020-11-29 20:32:15,086 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-11-29 20:32:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2020-11-29 20:32:15,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:32:15,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 48 [2020-11-29 20:32:15,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224356772] [2020-11-29 20:32:15,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 49 states [2020-11-29 20:32:15,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:32:15,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-11-29 20:32:15,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2008, Unknown=2, NotChecked=182, Total=2352 [2020-11-29 20:32:15,189 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 49 states. [2020-11-29 20:32:16,326 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-11-29 20:32:16,768 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-11-29 20:32:22,039 WARN L193 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-11-29 20:32:26,309 WARN L193 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-11-29 20:32:26,811 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2020-11-29 20:32:27,116 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2020-11-29 20:32:27,414 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2020-11-29 20:32:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:32:28,181 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2020-11-29 20:32:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-29 20:32:28,182 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 63 [2020-11-29 20:32:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:32:28,183 INFO L225 Difference]: With dead ends: 85 [2020-11-29 20:32:28,183 INFO L226 Difference]: Without dead ends: 85 [2020-11-29 20:32:28,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=503, Invalid=4759, Unknown=2, NotChecked=286, Total=5550 [2020-11-29 20:32:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-29 20:32:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2020-11-29 20:32:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-29 20:32:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2020-11-29 20:32:28,188 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 63 [2020-11-29 20:32:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:32:28,189 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2020-11-29 20:32:28,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2020-11-29 20:32:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-11-29 20:32:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-29 20:32:28,190 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:32:28,190 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-29 20:32:28,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-11-29 20:32:28,396 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:32:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:32:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash -178065538, now seen corresponding path program 2 times [2020-11-29 20:32:28,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:32:28,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569315542] [2020-11-29 20:32:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:32:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:28,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:32:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:28,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:32:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:29,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:32:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:30,434 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-11-29 20:32:30,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-29 20:32:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:32:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 20:32:30,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569315542] [2020-11-29 20:32:30,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307161229] [2020-11-29 20:32:30,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:32:31,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:32:31,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:32:31,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 111 conjunts are in the unsatisfiable core [2020-11-29 20:32:31,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:32:31,205 INFO L384 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 [2020-11-29 20:32:31,205 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,218 INFO L384 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 [2020-11-29 20:32:31,218 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,227 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,227 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2020-11-29 20:32:31,288 INFO L384 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 28 treesize of output 23 [2020-11-29 20:32:31,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:31,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:31,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:31,302 INFO L384 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 18 treesize of output 22 [2020-11-29 20:32:31,303 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,324 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,324 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,344 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,350 INFO L384 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 28 treesize of output 23 [2020-11-29 20:32:31,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:31,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:31,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:31,363 INFO L384 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 18 treesize of output 22 [2020-11-29 20:32:31,363 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,376 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,376 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,399 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,399 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,399 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:63, output treesize:45 [2020-11-29 20:32:31,652 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,652 INFO L384 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 [2020-11-29 20:32:31,652 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,677 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,678 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,678 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 [2020-11-29 20:32:31,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:31,818 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-11-29 20:32:31,819 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:31,868 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-11-29 20:32:31,868 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:31,895 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:31,895 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50 [2020-11-29 20:32:32,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:32,001 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-11-29 20:32:32,001 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:32,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:32,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:32,034 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-11-29 20:32:32,034 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:32,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:32,060 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:32,060 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:68 [2020-11-29 20:32:32,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:32,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:32,210 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2020-11-29 20:32:32,211 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:32,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:32,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:32,297 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2020-11-29 20:32:32,298 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:32,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:32,346 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:32:32,346 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2020-11-29 20:32:32,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:32,529 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2020-11-29 20:32:32,530 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:32,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:32,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:32,582 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:32:32,583 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:32:32,612 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:32,612 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 97 [2020-11-29 20:32:32,613 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:32,675 INFO L625 ElimStorePlain]: treesize reduction 60, result has 61.5 percent of original size [2020-11-29 20:32:32,676 INFO L545 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. [2020-11-29 20:32:32,677 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:96 [2020-11-29 20:32:38,068 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (let ((.cse0 (+ |c_dll_update_at_#in~head.offset| 4))) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) .cse0))) (and (<= dll_update_at_~head.offset (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_update_at_#in~head.base|) .cse0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (store (select |c_old(#memory_$Pointer$.base)| .cse1) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse1) dll_update_at_~head.offset)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (store (select |c_old(#memory_$Pointer$.offset)| .cse1) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.offset| .cse1) dll_update_at_~head.offset)))))))) is different from true [2020-11-29 20:32:38,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:38,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:38,121 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:32:38,122 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:32:38,299 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-29 20:32:38,300 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:32:38,300 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 138 treesize of output 327 [2020-11-29 20:32:38,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[15, 3, 2, 1] term [2020-11-29 20:32:38,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-11-29 20:32:38,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:38,305 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-11-29 20:32:38,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-11-29 20:32:38,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,307 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-11-29 20:32:38,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,309 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,311 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:32:38,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:38,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,315 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,317 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-11-29 20:32:38,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,325 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-11-29 20:32:38,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,327 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,328 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:32:38,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:38,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,333 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,337 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,342 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,344 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:32:38,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:38,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,349 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,353 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,367 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-11-29 20:32:38,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,370 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-11-29 20:32:38,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,372 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,376 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,382 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,387 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-11-29 20:32:38,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,391 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,397 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[15, 3, 2, 1] term [2020-11-29 20:32:38,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-11-29 20:32:38,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:38,407 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-11-29 20:32:38,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-11-29 20:32:38,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,410 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-11-29 20:32:38,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,411 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,413 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:32:38,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:38,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,419 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,423 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-11-29 20:32:38,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,432 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-11-29 20:32:38,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,434 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,435 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:32:38,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:38,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,442 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,446 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,452 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,454 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:32:38,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:38,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,460 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,465 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,472 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-11-29 20:32:38,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,474 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-11-29 20:32:38,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,477 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,482 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,488 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,494 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-11-29 20:32:38,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,497 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:32:38,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:38,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:38,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:38,503 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 20:32:38,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:38,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:38,508 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 20:32:38,862 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2020-11-29 20:32:38,862 INFO L625 ElimStorePlain]: treesize reduction 180, result has 46.1 percent of original size [2020-11-29 20:32:38,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:39,087 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2020-11-29 20:32:39,088 INFO L350 Elim1Store]: treesize reduction 112, result has 50.0 percent of original size [2020-11-29 20:32:39,088 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 127 [2020-11-29 20:32:39,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:39,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:39,098 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:39,500 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2020-11-29 20:32:39,501 INFO L625 ElimStorePlain]: treesize reduction 9, result has 96.4 percent of original size [2020-11-29 20:32:39,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 4, 2, 1] term [2020-11-29 20:32:39,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:39,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:39,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:39,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:39,520 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:32:39,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 2, 1] term [2020-11-29 20:32:39,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-11-29 20:32:39,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:39,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 2, 1] term [2020-11-29 20:32:39,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:39,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 2, 1] term [2020-11-29 20:32:39,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-11-29 20:32:39,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 2, 1] term [2020-11-29 20:32:39,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-11-29 20:32:39,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 2, 2, 1] term [2020-11-29 20:32:39,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-11-29 20:32:39,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,588 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-29 20:32:39,589 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:171, output treesize:238 [2020-11-29 20:32:39,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 4, 2, 1] term [2020-11-29 20:32:39,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:39,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:39,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:39,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:39,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:39,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:39,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:39,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:39,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:39,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:39,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:39,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:39,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:39,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:39,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:39,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 4, 2, 1] term [2020-11-29 20:32:39,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:39,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:39,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:39,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:39,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:39,986 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:32:39,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:39,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:39,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:39,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:39,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:39,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:39,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:39,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:39,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:40,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 4, 2, 1] term [2020-11-29 20:32:40,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:40,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:40,030 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2020-11-29 20:32:40,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 4, 2, 1] term [2020-11-29 20:32:40,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:40,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:40,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:40,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:40,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:40,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:40,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:40,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:40,929 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:32:40,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:40,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:40,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:40,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:40,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:40,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:40,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:40,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:40,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:40,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 4, 2, 1] term [2020-11-29 20:32:40,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:40,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:40,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:40,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:40,972 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2020-11-29 20:32:43,856 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.offset| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2020-11-29 20:32:43,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 4, 2, 1] term [2020-11-29 20:32:43,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:43,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:43,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:43,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:43,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:43,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:43,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:43,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:43,899 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:32:43,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:43,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:43,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:43,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:43,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:43,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:43,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:43,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:43,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:43,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:43,948 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:32:43,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:43,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:43,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:43,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:43,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:43,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:43,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:43,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:43,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:43,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:43,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:44,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:44,007 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:32:44,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:44,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:44,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:44,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:44,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:44,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:44,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:44,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:44,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:44,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:44,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 4, 2, 1] term [2020-11-29 20:32:44,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:44,050 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2020-11-29 20:32:44,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:44,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:44,273 INFO L244 Elim1Store]: Index analysis took 123 ms [2020-11-29 20:32:44,389 INFO L350 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2020-11-29 20:32:44,389 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 124 [2020-11-29 20:32:44,390 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:44,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:44,520 INFO L244 Elim1Store]: Index analysis took 106 ms [2020-11-29 20:32:44,596 INFO L350 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2020-11-29 20:32:44,596 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 1 [2020-11-29 20:32:44,597 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:44,723 INFO L350 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2020-11-29 20:32:44,723 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2020-11-29 20:32:44,723 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:44,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:44,831 INFO L350 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2020-11-29 20:32:44,831 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 79 [2020-11-29 20:32:44,832 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:44,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:44,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:44,956 INFO L244 Elim1Store]: Index analysis took 106 ms [2020-11-29 20:32:45,025 INFO L350 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2020-11-29 20:32:45,025 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 117 [2020-11-29 20:32:45,026 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:45,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,151 INFO L350 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2020-11-29 20:32:45,151 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 86 [2020-11-29 20:32:45,152 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:45,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,304 INFO L350 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2020-11-29 20:32:45,304 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 65 [2020-11-29 20:32:45,305 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:45,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,437 INFO L350 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2020-11-29 20:32:45,437 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 90 [2020-11-29 20:32:45,438 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:45,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,622 INFO L350 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2020-11-29 20:32:45,622 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 84 [2020-11-29 20:32:45,623 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:45,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,781 INFO L244 Elim1Store]: Index analysis took 129 ms [2020-11-29 20:32:45,869 INFO L350 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2020-11-29 20:32:45,869 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 112 [2020-11-29 20:32:45,870 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:45,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:45,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:46,065 INFO L350 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2020-11-29 20:32:46,065 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 117 [2020-11-29 20:32:46,066 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:46,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:46,171 INFO L350 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2020-11-29 20:32:46,171 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 79 [2020-11-29 20:32:46,172 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:46,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:46,306 INFO L350 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2020-11-29 20:32:46,306 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 82 [2020-11-29 20:32:46,307 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:46,428 INFO L350 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2020-11-29 20:32:46,428 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2020-11-29 20:32:46,428 INFO L545 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:46,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:46,546 INFO L350 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2020-11-29 20:32:46,546 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 86 [2020-11-29 20:32:46,547 INFO L545 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:46,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:46,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:46,724 INFO L350 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2020-11-29 20:32:46,725 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 124 [2020-11-29 20:32:46,726 INFO L545 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:46,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:46,849 INFO L350 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2020-11-29 20:32:46,849 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 90 [2020-11-29 20:32:46,850 INFO L545 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:46,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:46,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:46,989 INFO L350 Elim1Store]: treesize reduction 40, result has 57.9 percent of original size [2020-11-29 20:32:46,989 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 92 [2020-11-29 20:32:46,990 INFO L545 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:48,236 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 142 DAG size of output: 110 [2020-11-29 20:32:48,237 INFO L625 ElimStorePlain]: treesize reduction 1425, result has 32.9 percent of original size [2020-11-29 20:32:48,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,343 INFO L350 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2020-11-29 20:32:48,343 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 59 [2020-11-29 20:32:48,344 INFO L545 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:48,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,506 INFO L244 Elim1Store]: Index analysis took 121 ms [2020-11-29 20:32:48,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,542 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:32:48,665 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2020-11-29 20:32:48,669 INFO L350 Elim1Store]: treesize reduction 60, result has 47.4 percent of original size [2020-11-29 20:32:48,669 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 86 [2020-11-29 20:32:48,670 INFO L545 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:48,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,823 INFO L350 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2020-11-29 20:32:48,824 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 59 [2020-11-29 20:32:48,824 INFO L545 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:48,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:48,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:49,093 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-11-29 20:32:49,093 INFO L350 Elim1Store]: treesize reduction 52, result has 64.9 percent of original size [2020-11-29 20:32:49,093 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 179 treesize of output 199 [2020-11-29 20:32:49,094 INFO L545 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:49,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:32:49,156 INFO L350 Elim1Store]: treesize reduction 56, result has 45.6 percent of original size [2020-11-29 20:32:49,157 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 73 [2020-11-29 20:32:49,157 INFO L545 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:49,754 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2020-11-29 20:32:49,754 INFO L625 ElimStorePlain]: treesize reduction 106, result has 87.0 percent of original size [2020-11-29 20:32:49,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:49,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:49,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:49,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:49,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:49,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:49,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:49,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:49,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:49,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:49,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:49,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:49,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:49,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:49,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:49,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:49,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:49,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:49,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:49,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:49,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:49,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:49,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:49,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:49,799 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2020-11-29 20:32:49,799 INFO L244 ElimStorePlain]: Needed 24 recursive calls to eliminate 5 variables, input treesize:2585, output treesize:900 [2020-11-29 20:32:49,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:49,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:49,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:49,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:49,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:49,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:49,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:49,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:50,728 WARN L193 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 168 [2020-11-29 20:32:50,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:50,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:50,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:50,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:50,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:50,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:50,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:50,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:50,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:50,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:50,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:50,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:50,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:50,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:50,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:50,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:50,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:50,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:50,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:50,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:50,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:50,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:50,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:50,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:50,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:50,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:50,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:50,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:50,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:50,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:50,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:50,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:50,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:50,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:50,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:51,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:51,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:51,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:51,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:51,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:51,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:51,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:51,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:51,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:51,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:51,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:51,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:51,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:51,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:51,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:51,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:51,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:51,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:51,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:51,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:51,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:51,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:51,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:51,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:51,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:51,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:51,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:51,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:51,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:51,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:51,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:51,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:51,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:51,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:51,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:52,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:52,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:52,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:52,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:52,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:52,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:52,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:52,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:52,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:52,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:52,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:52,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:52,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:52,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:52,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:52,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:52,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:52,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:52,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:52,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:52,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:52,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:52,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:52,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:52,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:52,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:52,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:52,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:52,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:52,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:52,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:52,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:52,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:52,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:52,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:53,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:53,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:53,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:53,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:53,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:53,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:53,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:53,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:53,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:53,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:53,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:53,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:53,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:53,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:53,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:32:53,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:53,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:53,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:32:53,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:32:53,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:32:53,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:32:53,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 20:32:53,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 20:32:53,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-11-29 20:32:53,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:53,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-11-29 20:32:55,165 WARN L193 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2020-11-29 20:32:56,339 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2020-11-29 20:32:56,361 INFO L603 QuantifierPusher]: Distributing 13 conjuncts over 3 disjuncts [2020-11-29 20:32:56,422 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2020-11-29 20:32:56,424 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,445 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2020-11-29 20:32:56,446 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,468 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2020-11-29 20:32:56,469 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,495 INFO L384 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 [2020-11-29 20:32:56,496 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,519 INFO L384 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 [2020-11-29 20:32:56,521 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,544 INFO L384 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 [2020-11-29 20:32:56,545 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,570 INFO L384 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 [2020-11-29 20:32:56,571 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,594 INFO L384 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 [2020-11-29 20:32:56,595 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,619 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2020-11-29 20:32:56,620 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,644 INFO L384 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 [2020-11-29 20:32:56,645 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,665 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2020-11-29 20:32:56,666 INFO L545 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,687 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2020-11-29 20:32:56,688 INFO L545 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:56,709 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2020-11-29 20:32:56,710 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-11-29 20:32:57,840 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 268 DAG size of output: 266 [2020-11-29 20:32:57,841 INFO L625 ElimStorePlain]: treesize reduction 8, result has 99.4 percent of original size [2020-11-29 20:32:57,849 INFO L545 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 13 xjuncts. [2020-11-29 20:32:57,849 INFO L244 ElimStorePlain]: Needed 14 recursive calls to eliminate 12 variables, input treesize:1535, output treesize:1434 [2020-11-29 20:33:05,049 WARN L193 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 363 [2020-11-29 20:33:11,474 WARN L193 SmtUtils]: Spent 4.81 s on a formula simplification that was a NOOP. DAG size: 363 [2020-11-29 20:33:12,827 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 35 [2020-11-29 20:33:13,170 INFO L441 ElimStorePlain]: Different costs {18=[|#memory_$Pointer$.offset|], 25=[|#memory_$Pointer$.base|]} [2020-11-29 20:33:13,243 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:33:13,243 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 159 [2020-11-29 20:33:13,244 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:33:13,245 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:33:13,245 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-29 20:33:13,246 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:33:13,246 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:33:13,248 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:33:13,248 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:33:13,249 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-29 20:33:13,250 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:33:13,250 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 20:33:13,251 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 20:33:13,352 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-11-29 20:33:13,353 INFO L625 ElimStorePlain]: treesize reduction 78, result has 52.1 percent of original size [2020-11-29 20:33:13,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:33:13,366 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:33:13,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 20:33:13,368 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 20:33:13,524 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-11-29 20:33:13,524 INFO L350 Elim1Store]: treesize reduction 8, result has 92.0 percent of original size [2020-11-29 20:33:13,524 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 57 treesize of output 114 [2020-11-29 20:33:13,525 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 20:33:13,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:33:13,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:33:13,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:33:13,527 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 20:33:13,527 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 20:33:13,528 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 20:33:13,649 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2020-11-29 20:33:13,649 INFO L625 ElimStorePlain]: treesize reduction 191, result has 20.7 percent of original size [2020-11-29 20:33:13,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:33:13,659 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 20:33:13,659 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:35 [2020-11-29 20:33:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2020-11-29 20:33:14,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:33:14,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 63 [2020-11-29 20:33:14,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722303015] [2020-11-29 20:33:14,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 63 states [2020-11-29 20:33:14,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:33:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2020-11-29 20:33:14,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3476, Unknown=3, NotChecked=238, Total=3906 [2020-11-29 20:33:14,270 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 63 states. [2020-11-29 20:33:58,307 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2020-11-29 20:34:00,194 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-11-29 20:34:00,586 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2020-11-29 20:34:07,144 WARN L193 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-11-29 20:34:20,104 WARN L193 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2020-11-29 20:34:25,275 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 68 [2020-11-29 20:34:27,369 WARN L193 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 99 [2020-11-29 20:34:31,796 WARN L193 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 637 DAG size of output: 117 [2020-11-29 20:34:35,717 WARN L193 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 635 DAG size of output: 116 [2020-11-29 20:34:41,226 WARN L193 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 78 [2020-11-29 20:34:42,821 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 93 [2020-11-29 20:34:44,092 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 89 [2020-11-29 20:34:45,787 WARN L193 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 78 [2020-11-29 20:34:46,830 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 52 [2020-11-29 20:34:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:34:48,605 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2020-11-29 20:34:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-29 20:34:48,606 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 66 [2020-11-29 20:34:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:34:48,607 INFO L225 Difference]: With dead ends: 121 [2020-11-29 20:34:48,607 INFO L226 Difference]: Without dead ends: 121 [2020-11-29 20:34:48,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 33 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=527, Invalid=8027, Unknown=10, NotChecked=366, Total=8930 [2020-11-29 20:34:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-29 20:34:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2020-11-29 20:34:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-11-29 20:34:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2020-11-29 20:34:48,617 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 66 [2020-11-29 20:34:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:34:48,617 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2020-11-29 20:34:48,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2020-11-29 20:34:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2020-11-29 20:34:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-29 20:34:48,618 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:34:48,618 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:34:48,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:34:48,832 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:34:48,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:34:48,833 INFO L82 PathProgramCache]: Analyzing trace with hash -467121885, now seen corresponding path program 2 times [2020-11-29 20:34:48,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:34:48,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592648058] [2020-11-29 20:34:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:34:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:49,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:34:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:49,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:34:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:49,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-29 20:34:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:49,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-29 20:34:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:50,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-29 20:34:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-29 20:34:50,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592648058] [2020-11-29 20:34:50,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955209817] [2020-11-29 20:34:50,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/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 [2020-11-29 20:34:50,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 20:34:50,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:34:50,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 82 conjunts are in the unsatisfiable core [2020-11-29 20:34:50,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:34:50,915 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 20:34:50,916 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: var is still there: |v_#valid_60| input size 43 context size 43 output size 43 [2020-11-29 20:34:50,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:34:50,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-29 20:34:50,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73406989] [2020-11-29 20:34:50,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-29 20:34:50,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:34:50,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-29 20:34:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2020-11-29 20:34:50,917 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 28 states. [2020-11-29 20:34:53,292 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-11-29 20:34:53,471 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-11-29 20:34:54,466 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-11-29 20:34:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:34:54,721 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2020-11-29 20:34:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-29 20:34:54,722 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2020-11-29 20:34:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:34:54,723 INFO L225 Difference]: With dead ends: 131 [2020-11-29 20:34:54,723 INFO L226 Difference]: Without dead ends: 99 [2020-11-29 20:34:54,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=249, Invalid=2007, Unknown=0, NotChecked=0, Total=2256 [2020-11-29 20:34:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-29 20:34:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2020-11-29 20:34:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-29 20:34:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2020-11-29 20:34:54,727 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 69 [2020-11-29 20:34:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:34:54,727 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2020-11-29 20:34:54,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-29 20:34:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2020-11-29 20:34:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-29 20:34:54,728 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:34:54,728 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-11-29 20:34:54,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-11-29 20:34:54,940 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2020-11-29 20:34:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:34:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1463347818, now seen corresponding path program 3 times [2020-11-29 20:34:54,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:34:54,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895837474] [2020-11-29 20:34:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:34:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:55,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 20:34:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:55,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-29 20:34:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:55,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 20:34:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:55,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-29 20:34:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:34:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-29 20:34:55,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895837474] [2020-11-29 20:34:55,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170101198] [2020-11-29 20:34:55,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:34:55,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-29 20:34:55,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 20:34:55,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 20:34:55,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:34:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-29 20:34:56,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:34:56,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2020-11-29 20:34:56,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204272952] [2020-11-29 20:34:56,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 20:34:56,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:34:56,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 20:34:56,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:34:56,039 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 12 states. [2020-11-29 20:34:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:34:56,363 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-11-29 20:34:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:34:56,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2020-11-29 20:34:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:34:56,365 INFO L225 Difference]: With dead ends: 35 [2020-11-29 20:34:56,365 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 20:34:56,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2020-11-29 20:34:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 20:34:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 20:34:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 20:34:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 20:34:56,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-11-29 20:34:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:34:56,366 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 20:34:56,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 20:34:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 20:34:56,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 20:34:56,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-11-29 20:34:56,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 08:34:56 BoogieIcfgContainer [2020-11-29 20:34:56,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 20:34:56,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:34:56,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:34:56,572 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:34:56,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:26:19" (3/4) ... [2020-11-29 20:34:56,576 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 20:34:56,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-11-29 20:34:56,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_update_at [2020-11-29 20:34:56,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-11-29 20:34:56,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2020-11-29 20:34:56,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2020-11-29 20:34:56,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-11-29 20:34:56,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-11-29 20:34:56,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_get_data_at [2020-11-29 20:34:56,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-11-29 20:34:56,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_destroy [2020-11-29 20:34:56,584 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2020-11-29 20:34:56,592 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-11-29 20:34:56,593 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-11-29 20:34:56,593 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-29 20:34:56,593 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 20:34:56,637 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7d696df9-a7fb-44a2-aca7-8c5c55992ce6/bin/uautomizer/witness.graphml [2020-11-29 20:34:56,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:34:56,638 INFO L168 Benchmark]: Toolchain (without parser) took 518668.40 ms. Allocated memory was 96.5 MB in the beginning and 268.4 MB in the end (delta: 172.0 MB). Free memory was 67.0 MB in the beginning and 130.6 MB in the end (delta: -63.6 MB). Peak memory consumption was 107.8 MB. Max. memory is 16.1 GB. [2020-11-29 20:34:56,638 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 96.5 MB. Free memory is still 56.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:34:56,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.21 ms. Allocated memory is still 96.5 MB. Free memory was 66.8 MB in the beginning and 60.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:34:56,639 INFO L168 Benchmark]: Boogie Preprocessor took 95.05 ms. Allocated memory is still 96.5 MB. Free memory was 60.0 MB in the beginning and 56.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 20:34:56,639 INFO L168 Benchmark]: RCFGBuilder took 993.12 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 56.9 MB in the beginning and 92.7 MB in the end (delta: -35.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.1 GB. [2020-11-29 20:34:56,640 INFO L168 Benchmark]: TraceAbstraction took 516959.28 ms. Allocated memory was 117.4 MB in the beginning and 268.4 MB in the end (delta: 151.0 MB). Free memory was 91.8 MB in the beginning and 134.8 MB in the end (delta: -43.0 MB). Peak memory consumption was 108.8 MB. Max. memory is 16.1 GB. [2020-11-29 20:34:56,640 INFO L168 Benchmark]: Witness Printer took 65.13 ms. Allocated memory is still 268.4 MB. Free memory was 134.8 MB in the beginning and 130.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 20:34:56,642 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 96.5 MB. Free memory is still 56.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 549.21 ms. Allocated memory is still 96.5 MB. Free memory was 66.8 MB in the beginning and 60.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 95.05 ms. Allocated memory is still 96.5 MB. Free memory was 60.0 MB in the beginning and 56.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 993.12 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 56.9 MB in the beginning and 92.7 MB in the end (delta: -35.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 516959.28 ms. Allocated memory was 117.4 MB in the beginning and 268.4 MB in the end (delta: 151.0 MB). Free memory was 91.8 MB in the beginning and 134.8 MB in the end (delta: -43.0 MB). Peak memory consumption was 108.8 MB. Max. memory is 16.1 GB. * Witness Printer took 65.13 ms. Allocated memory is still 268.4 MB. Free memory was 134.8 MB in the beginning and 130.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 113 locations, 29 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 516.8s, OverallIterations: 27, TraceHistogramMax: 3, AutomataDifference: 313.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1102 SDtfs, 2844 SDslu, 4307 SDs, 0 SdLazy, 18854 SolverSat, 907 SolverUnsat, 80 SolverUnknown, 0 SolverNotchecked, 180.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1435 GetRequests, 642 SyntacticMatches, 31 SemanticMatches, 762 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 8129 ImplicationChecksByTransitivity, 303.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 321 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 194.9s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1797 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1769 ConstructedInterpolants, 135 QuantifiedInterpolants, 1948469 SizeOfPredicates, 210 NumberOfNonLiveVariables, 4045 ConjunctsInSsa, 616 ConjunctsInUnsatCore, 42 InterpolantComputations, 13 PerfectInterpolantSequences, 322/645 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...