./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/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 9459b8edd4bc1a8100b2516dc16681291af0c7dd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/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 9459b8edd4bc1a8100b2516dc16681291af0c7dd ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:46:37,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:46:37,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:46:37,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:46:37,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:46:37,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:46:37,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:46:37,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:46:37,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:46:37,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:46:37,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:46:37,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:46:37,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:46:37,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:46:37,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:46:37,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:46:37,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:46:37,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:46:37,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:46:37,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:46:37,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:46:37,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:46:37,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:46:37,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:46:37,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:46:37,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:46:37,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:46:37,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:46:37,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:46:37,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:46:37,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:46:37,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:46:37,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:46:37,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:46:37,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:46:37,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:46:37,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:46:37,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:46:37,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:46:37,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:46:37,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:46:37,300 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:46:37,325 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:46:37,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:46:37,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:46:37,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:46:37,327 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:46:37,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:46:37,328 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:46:37,328 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:46:37,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:46:37,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:46:37,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:46:37,329 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:46:37,329 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:46:37,329 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:46:37,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:46:37,330 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:46:37,330 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:46:37,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:46:37,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:46:37,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:46:37,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:46:37,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:46:37,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:46:37,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:46:37,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:46:37,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:46:37,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/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 -> 9459b8edd4bc1a8100b2516dc16681291af0c7dd [2019-11-15 21:46:37,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:46:37,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:46:37,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:46:37,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:46:37,382 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:46:37,383 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2019-11-15 21:46:37,433 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data/dff895ccd/4ca08c5988244390bea52905ac0b8f6e/FLAG3af06924c [2019-11-15 21:46:37,947 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:46:37,948 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2019-11-15 21:46:37,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data/dff895ccd/4ca08c5988244390bea52905ac0b8f6e/FLAG3af06924c [2019-11-15 21:46:38,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data/dff895ccd/4ca08c5988244390bea52905ac0b8f6e [2019-11-15 21:46:38,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:46:38,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:46:38,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:46:38,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:46:38,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:46:38,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:46:38" (1/1) ... [2019-11-15 21:46:38,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c46c65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38, skipping insertion in model container [2019-11-15 21:46:38,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:46:38" (1/1) ... [2019-11-15 21:46:38,193 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:46:38,230 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:46:38,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:46:38,672 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:46:38,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:46:38,784 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:46:38,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38 WrapperNode [2019-11-15 21:46:38,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:46:38,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:46:38,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:46:38,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:46:38,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38" (1/1) ... [2019-11-15 21:46:38,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38" (1/1) ... [2019-11-15 21:46:38,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38" (1/1) ... [2019-11-15 21:46:38,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38" (1/1) ... [2019-11-15 21:46:38,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38" (1/1) ... [2019-11-15 21:46:38,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38" (1/1) ... [2019-11-15 21:46:38,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38" (1/1) ... [2019-11-15 21:46:38,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:46:38,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:46:38,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:46:38,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:46:38,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:46:38,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:46:38,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:46:38,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:46:38,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:46:38,916 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:46:38,916 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 21:46:38,917 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-15 21:46:38,917 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-15 21:46:38,918 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_insert [2019-11-15 21:46:38,918 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:46:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:46:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:46:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:46:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:46:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:46:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:46:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:46:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:46:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:46:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:46:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:46:38,923 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:46:38,924 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:46:38,924 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:46:38,924 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:46:38,924 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:46:38,924 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:46:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:46:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:46:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:46:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:46:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:46:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:46:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:46:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:46:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:46:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:46:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:46:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:46:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:46:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:46:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:46:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:46:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:46:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:46:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:46:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:46:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:46:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:46:38,928 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:46:38,928 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:46:38,928 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:46:38,928 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:46:38,928 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:46:38,928 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:46:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:46:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:46:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:46:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:46:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:46:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:46:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:46:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:46:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:46:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:46:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:46:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:46:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:46:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:46:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:46:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:46:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:46:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:46:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:46:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:46:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:46:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:46:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:46:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:46:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:46:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:46:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:46:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:46:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:46:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:46:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:46:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:46:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:46:38,933 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:46:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:46:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:46:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:46:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:46:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 21:46:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:46:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:46:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:46:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-15 21:46:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-15 21:46:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:46:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:46:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_insert [2019-11-15 21:46:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:46:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:46:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:46:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:46:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:46:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:46:39,430 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:46:39,764 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:46:39,765 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 21:46:39,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:46:39 BoogieIcfgContainer [2019-11-15 21:46:39,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:46:39,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:46:39,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:46:39,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:46:39,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:46:38" (1/3) ... [2019-11-15 21:46:39,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ec6d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:46:39, skipping insertion in model container [2019-11-15 21:46:39,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:46:38" (2/3) ... [2019-11-15 21:46:39,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ec6d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:46:39, skipping insertion in model container [2019-11-15 21:46:39,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:46:39" (3/3) ... [2019-11-15 21:46:39,774 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2019-11-15 21:46:39,783 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:46:39,791 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-15 21:46:39,802 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-15 21:46:39,821 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:46:39,821 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:46:39,821 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:46:39,822 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:46:39,822 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:46:39,822 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:46:39,822 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:46:39,822 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:46:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2019-11-15 21:46:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:46:39,862 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:39,863 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:46:39,866 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:39,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash -799534984, now seen corresponding path program 1 times [2019-11-15 21:46:39,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:39,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784378969] [2019-11-15 21:46:39,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:39,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:39,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:46:40,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784378969] [2019-11-15 21:46:40,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:40,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:46:40,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779619164] [2019-11-15 21:46:40,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:46:40,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:40,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:46:40,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:40,099 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 4 states. [2019-11-15 21:46:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:40,627 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2019-11-15 21:46:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:46:40,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 21:46:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:40,642 INFO L225 Difference]: With dead ends: 186 [2019-11-15 21:46:40,642 INFO L226 Difference]: Without dead ends: 179 [2019-11-15 21:46:40,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-15 21:46:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 160. [2019-11-15 21:46:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-15 21:46:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2019-11-15 21:46:40,721 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 12 [2019-11-15 21:46:40,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:40,721 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2019-11-15 21:46:40,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:46:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2019-11-15 21:46:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:46:40,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:40,723 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:46:40,724 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:40,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:40,725 INFO L82 PathProgramCache]: Analyzing trace with hash -799534983, now seen corresponding path program 1 times [2019-11-15 21:46:40,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:40,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679576640] [2019-11-15 21:46:40,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:40,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:40,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:46:40,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679576640] [2019-11-15 21:46:40,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:40,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:46:40,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129773698] [2019-11-15 21:46:40,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:46:40,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:46:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:40,873 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 4 states. [2019-11-15 21:46:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:41,279 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2019-11-15 21:46:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:46:41,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 21:46:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:41,282 INFO L225 Difference]: With dead ends: 176 [2019-11-15 21:46:41,282 INFO L226 Difference]: Without dead ends: 176 [2019-11-15 21:46:41,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:46:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-15 21:46:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2019-11-15 21:46:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-15 21:46:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2019-11-15 21:46:41,294 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 12 [2019-11-15 21:46:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:41,294 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2019-11-15 21:46:41,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:46:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2019-11-15 21:46:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:46:41,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:41,296 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:46:41,296 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:41,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2095176132, now seen corresponding path program 1 times [2019-11-15 21:46:41,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:41,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727633675] [2019-11-15 21:46:41,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:41,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:41,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:46:41,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727633675] [2019-11-15 21:46:41,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:41,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:46:41,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075278096] [2019-11-15 21:46:41,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:46:41,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:41,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:46:41,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:46:41,432 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 7 states. [2019-11-15 21:46:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:41,965 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2019-11-15 21:46:41,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:46:41,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-15 21:46:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:41,968 INFO L225 Difference]: With dead ends: 177 [2019-11-15 21:46:41,968 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 21:46:41,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:46:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 21:46:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 158. [2019-11-15 21:46:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 21:46:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2019-11-15 21:46:42,020 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 20 [2019-11-15 21:46:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:42,022 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2019-11-15 21:46:42,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:46:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2019-11-15 21:46:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:46:42,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:42,023 INFO L380 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] [2019-11-15 21:46:42,027 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:42,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash -910325507, now seen corresponding path program 1 times [2019-11-15 21:46:42,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:42,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960612043] [2019-11-15 21:46:42,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:42,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:42,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:46:42,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960612043] [2019-11-15 21:46:42,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:42,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:46:42,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527009678] [2019-11-15 21:46:42,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:46:42,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:42,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:46:42,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:46:42,304 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 9 states. [2019-11-15 21:46:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:43,042 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2019-11-15 21:46:43,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:46:43,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-15 21:46:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:43,044 INFO L225 Difference]: With dead ends: 177 [2019-11-15 21:46:43,044 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 21:46:43,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:46:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 21:46:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 157. [2019-11-15 21:46:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-15 21:46:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2019-11-15 21:46:43,055 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 30 [2019-11-15 21:46:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:43,055 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2019-11-15 21:46:43,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:46:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2019-11-15 21:46:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:46:43,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:43,057 INFO L380 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] [2019-11-15 21:46:43,058 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash -910325508, now seen corresponding path program 1 times [2019-11-15 21:46:43,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:43,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925491190] [2019-11-15 21:46:43,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:43,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:43,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:46:43,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925491190] [2019-11-15 21:46:43,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:43,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:46:43,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951817610] [2019-11-15 21:46:43,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:46:43,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:43,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:46:43,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:46:43,200 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 8 states. [2019-11-15 21:46:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:43,791 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2019-11-15 21:46:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:46:43,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-15 21:46:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:43,793 INFO L225 Difference]: With dead ends: 176 [2019-11-15 21:46:43,793 INFO L226 Difference]: Without dead ends: 176 [2019-11-15 21:46:43,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:46:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-15 21:46:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 156. [2019-11-15 21:46:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-15 21:46:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2019-11-15 21:46:43,801 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 30 [2019-11-15 21:46:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:43,801 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2019-11-15 21:46:43,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:46:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2019-11-15 21:46:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:46:43,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:43,803 INFO L380 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] [2019-11-15 21:46:43,803 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:43,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1350514845, now seen corresponding path program 1 times [2019-11-15 21:46:43,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:43,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257432414] [2019-11-15 21:46:43,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:43,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:43,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:46:43,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257432414] [2019-11-15 21:46:43,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642442117] [2019-11-15 21:46:43,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:44,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 21:46:44,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:46:44,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:46:44,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:44,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-11-15 21:46:44,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:44,320 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:46:44,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:46:44,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-15 21:46:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:46:44,329 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:46:44,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-15 21:46:44,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775190551] [2019-11-15 21:46:44,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:46:44,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:46:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:46:44,332 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 12 states. [2019-11-15 21:46:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:45,650 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2019-11-15 21:46:45,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:46:45,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-11-15 21:46:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:45,659 INFO L225 Difference]: With dead ends: 183 [2019-11-15 21:46:45,659 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 21:46:45,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:46:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 21:46:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2019-11-15 21:46:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 21:46:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2019-11-15 21:46:45,673 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 32 [2019-11-15 21:46:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:45,674 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2019-11-15 21:46:45,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:46:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2019-11-15 21:46:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:46:45,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:45,677 INFO L380 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] [2019-11-15 21:46:45,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:45,890 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:45,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:45,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1350514846, now seen corresponding path program 1 times [2019-11-15 21:46:45,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:45,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917664622] [2019-11-15 21:46:45,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:45,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:45,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:46:46,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917664622] [2019-11-15 21:46:46,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721968647] [2019-11-15 21:46:46,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:46,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 21:46:46,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:46:46,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:46:46,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:46,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:46,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:46:46,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:46:46,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:46,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:46:46,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:46,618 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 21:46:46,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:46:46,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-15 21:46:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:46:46,629 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:46:46,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-15 21:46:46,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625038712] [2019-11-15 21:46:46,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:46:46,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:46,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:46:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:46:46,631 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand 16 states. [2019-11-15 21:46:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:48,036 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2019-11-15 21:46:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:46:48,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-15 21:46:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:48,038 INFO L225 Difference]: With dead ends: 183 [2019-11-15 21:46:48,038 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 21:46:48,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:46:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 21:46:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2019-11-15 21:46:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 21:46:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2019-11-15 21:46:48,044 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 32 [2019-11-15 21:46:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:48,044 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2019-11-15 21:46:48,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:46:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2019-11-15 21:46:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:46:48,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:48,046 INFO L380 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, 1, 1] [2019-11-15 21:46:48,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:48,251 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:48,251 INFO L82 PathProgramCache]: Analyzing trace with hash 764796724, now seen corresponding path program 1 times [2019-11-15 21:46:48,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:48,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635230973] [2019-11-15 21:46:48,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:48,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:48,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:46:48,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635230973] [2019-11-15 21:46:48,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292732576] [2019-11-15 21:46:48,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:48,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 21:46:48,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:46:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:46:48,621 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:46:48,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-15 21:46:48,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574942445] [2019-11-15 21:46:48,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:46:48,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:46:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:46:48,623 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand 8 states. [2019-11-15 21:46:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:49,218 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2019-11-15 21:46:49,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:46:49,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-15 21:46:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:49,219 INFO L225 Difference]: With dead ends: 181 [2019-11-15 21:46:49,220 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 21:46:49,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:46:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 21:46:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2019-11-15 21:46:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 21:46:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2019-11-15 21:46:49,226 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 34 [2019-11-15 21:46:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:49,227 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2019-11-15 21:46:49,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:46:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2019-11-15 21:46:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:46:49,228 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:49,228 INFO L380 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, 1, 1, 1] [2019-11-15 21:46:49,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:49,429 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:49,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2065886027, now seen corresponding path program 1 times [2019-11-15 21:46:49,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:49,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936705331] [2019-11-15 21:46:49,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:49,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:49,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:46:49,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936705331] [2019-11-15 21:46:49,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257742248] [2019-11-15 21:46:49,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:49,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 21:46:49,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:46:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:46:49,827 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:46:49,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-11-15 21:46:49,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843697389] [2019-11-15 21:46:49,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:46:49,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:49,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:46:49,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:46:49,828 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 11 states. [2019-11-15 21:46:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:50,568 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2019-11-15 21:46:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:46:50,569 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-15 21:46:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:50,571 INFO L225 Difference]: With dead ends: 191 [2019-11-15 21:46:50,571 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 21:46:50,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:46:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 21:46:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 164. [2019-11-15 21:46:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-15 21:46:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 176 transitions. [2019-11-15 21:46:50,577 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 176 transitions. Word has length 35 [2019-11-15 21:46:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:50,577 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 176 transitions. [2019-11-15 21:46:50,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:46:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2019-11-15 21:46:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:46:50,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:50,578 INFO L380 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, 1, 1, 1] [2019-11-15 21:46:50,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:50,779 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2065886028, now seen corresponding path program 1 times [2019-11-15 21:46:50,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:50,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009711077] [2019-11-15 21:46:50,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:50,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:50,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:46:50,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009711077] [2019-11-15 21:46:50,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062734246] [2019-11-15 21:46:50,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:51,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:46:51,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:46:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:46:51,027 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:46:51,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 6 [2019-11-15 21:46:51,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400081857] [2019-11-15 21:46:51,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:46:51,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:46:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:46:51,030 INFO L87 Difference]: Start difference. First operand 164 states and 176 transitions. Second operand 7 states. [2019-11-15 21:46:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:51,544 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2019-11-15 21:46:51,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:46:51,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-15 21:46:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:51,546 INFO L225 Difference]: With dead ends: 184 [2019-11-15 21:46:51,546 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 21:46:51,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:46:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 21:46:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 164. [2019-11-15 21:46:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-15 21:46:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2019-11-15 21:46:51,551 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 35 [2019-11-15 21:46:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:51,552 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2019-11-15 21:46:51,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:46:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2019-11-15 21:46:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:46:51,556 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:51,556 INFO L380 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, 1, 1, 1, 1] [2019-11-15 21:46:51,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:51,766 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:51,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:51,767 INFO L82 PathProgramCache]: Analyzing trace with hash 382042575, now seen corresponding path program 1 times [2019-11-15 21:46:51,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:51,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850026878] [2019-11-15 21:46:51,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:51,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:51,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:46:51,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850026878] [2019-11-15 21:46:51,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:51,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:46:51,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618475092] [2019-11-15 21:46:51,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:46:51,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:51,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:46:51,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:46:51,898 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 9 states. [2019-11-15 21:46:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:52,560 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2019-11-15 21:46:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:46:52,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-15 21:46:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:52,562 INFO L225 Difference]: With dead ends: 183 [2019-11-15 21:46:52,562 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 21:46:52,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:46:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 21:46:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-11-15 21:46:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 21:46:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2019-11-15 21:46:52,570 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 36 [2019-11-15 21:46:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:52,572 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 174 transitions. [2019-11-15 21:46:52,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:46:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 174 transitions. [2019-11-15 21:46:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:46:52,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:52,579 INFO L380 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, 1, 1, 1, 1] [2019-11-15 21:46:52,579 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash 382042576, now seen corresponding path program 1 times [2019-11-15 21:46:52,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:52,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916277169] [2019-11-15 21:46:52,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:52,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:52,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:46:52,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916277169] [2019-11-15 21:46:52,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:52,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:46:52,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583893573] [2019-11-15 21:46:52,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:46:52,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:46:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:46:52,777 INFO L87 Difference]: Start difference. First operand 163 states and 174 transitions. Second operand 10 states. [2019-11-15 21:46:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:53,739 INFO L93 Difference]: Finished difference Result 181 states and 193 transitions. [2019-11-15 21:46:53,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:46:53,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-15 21:46:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:53,741 INFO L225 Difference]: With dead ends: 181 [2019-11-15 21:46:53,742 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 21:46:53,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:46:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 21:46:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2019-11-15 21:46:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-15 21:46:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2019-11-15 21:46:53,747 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 36 [2019-11-15 21:46:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:53,748 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2019-11-15 21:46:53,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:46:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2019-11-15 21:46:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:46:53,749 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:53,749 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:46:53,750 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash 825702806, now seen corresponding path program 1 times [2019-11-15 21:46:53,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:53,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577368538] [2019-11-15 21:46:53,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:53,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:53,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 21:46:53,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577368538] [2019-11-15 21:46:53,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:46:53,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:46:53,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493031461] [2019-11-15 21:46:53,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:46:53,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:53,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:46:53,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:46:53,901 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 8 states. [2019-11-15 21:46:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:54,315 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2019-11-15 21:46:54,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:46:54,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-15 21:46:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:54,317 INFO L225 Difference]: With dead ends: 169 [2019-11-15 21:46:54,317 INFO L226 Difference]: Without dead ends: 169 [2019-11-15 21:46:54,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:46:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-15 21:46:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 150. [2019-11-15 21:46:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 21:46:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2019-11-15 21:46:54,323 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 47 [2019-11-15 21:46:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:54,323 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2019-11-15 21:46:54,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:46:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2019-11-15 21:46:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 21:46:54,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:54,325 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:46:54,325 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash 277098478, now seen corresponding path program 1 times [2019-11-15 21:46:54,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:54,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953224147] [2019-11-15 21:46:54,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:54,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:54,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:46:55,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953224147] [2019-11-15 21:46:55,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859197338] [2019-11-15 21:46:55,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:55,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 21:46:55,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:46:55,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:46:55,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:55,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:55,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:46:55,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:46:55,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 21:46:55,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:55,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:55,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:46:55,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 21:46:55,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:55,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:55,610 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 21:46:55,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 21:46:55,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:55,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:55,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:46:55,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2019-11-15 21:46:55,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:55,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:46:55,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:55,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:55,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:46:55,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 21:46:55,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:55,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:55,772 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:55,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-15 21:46:55,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:55,797 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-15 21:46:55,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:46:55,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-15 21:46:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 21:46:55,847 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:46:55,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2019-11-15 21:46:55,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322752275] [2019-11-15 21:46:55,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 21:46:55,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:55,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 21:46:55,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:46:55,850 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 22 states. [2019-11-15 21:46:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:57,274 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2019-11-15 21:46:57,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:46:57,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2019-11-15 21:46:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:57,279 INFO L225 Difference]: With dead ends: 161 [2019-11-15 21:46:57,279 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 21:46:57,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2019-11-15 21:46:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 21:46:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2019-11-15 21:46:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-15 21:46:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2019-11-15 21:46:57,286 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 53 [2019-11-15 21:46:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:57,286 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2019-11-15 21:46:57,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 21:46:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2019-11-15 21:46:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 21:46:57,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:57,288 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:46:57,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:57,495 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash 277098479, now seen corresponding path program 1 times [2019-11-15 21:46:57,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:57,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044281539] [2019-11-15 21:46:57,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:57,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:57,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 21:46:58,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044281539] [2019-11-15 21:46:58,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592096011] [2019-11-15 21:46:58,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:46:58,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 21:46:58,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:46:58,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:46:58,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:58,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:58,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:46:58,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 21:46:58,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 21:46:58,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:58,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:58,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:46:58,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 21:46:58,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:58,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:58,409 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 21:46:58,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 21:46:58,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:58,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:58,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:46:58,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-15 21:46:58,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:58,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:46:58,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:58,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:58,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:46:58,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 21:46:58,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:58,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:46:58,600 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:46:58,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-15 21:46:58,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:46:58,646 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-15 21:46:58,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:46:58,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-15 21:46:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 21:46:58,689 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:46:58,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-15 21:46:58,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303023146] [2019-11-15 21:46:58,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:46:58,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:46:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:46:58,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:46:58,690 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 18 states. [2019-11-15 21:46:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:46:59,694 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2019-11-15 21:46:59,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:46:59,695 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2019-11-15 21:46:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:46:59,696 INFO L225 Difference]: With dead ends: 150 [2019-11-15 21:46:59,696 INFO L226 Difference]: Without dead ends: 150 [2019-11-15 21:46:59,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:46:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-15 21:46:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2019-11-15 21:46:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 21:46:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2019-11-15 21:46:59,701 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 53 [2019-11-15 21:46:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:46:59,702 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2019-11-15 21:46:59,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:46:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2019-11-15 21:46:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:46:59,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:46:59,703 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:46:59,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:46:59,908 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:46:59,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:46:59,908 INFO L82 PathProgramCache]: Analyzing trace with hash 113704845, now seen corresponding path program 1 times [2019-11-15 21:46:59,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:46:59,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750836190] [2019-11-15 21:46:59,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:59,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:46:59,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:46:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:47:00,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750836190] [2019-11-15 21:47:00,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770654871] [2019-11-15 21:47:00,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:47:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:47:00,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-15 21:47:00,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:47:00,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-15 21:47:00,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:47:00,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:47:00,878 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_2| vanished before elimination [2019-11-15 21:47:00,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:47:00,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-15 21:47:15,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:47:15,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-15 21:47:15,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:47:15,653 INFO L567 ElimStorePlain]: treesize reduction 26, result has 65.8 percent of original size [2019-11-15 21:47:15,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:47:15,679 INFO L341 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2019-11-15 21:47:15,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2019-11-15 21:47:15,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:47:15,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:47:15,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:47:15,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:39 [2019-11-15 21:47:17,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:47:17,787 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 21:47:17,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 15 [2019-11-15 21:47:17,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:47:17,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:47:17,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:47:17,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:11 [2019-11-15 21:47:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:47:17,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:47:17,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [20] total 31 [2019-11-15 21:47:17,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45847345] [2019-11-15 21:47:17,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:47:17,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:47:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:47:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=898, Unknown=9, NotChecked=0, Total=992 [2019-11-15 21:47:17,814 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 18 states. [2019-11-15 21:47:34,425 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-11-15 21:47:37,833 WARN L191 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-11-15 21:47:39,490 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-11-15 21:48:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:13,510 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions. [2019-11-15 21:48:13,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 21:48:13,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-11-15 21:48:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:13,512 INFO L225 Difference]: With dead ends: 197 [2019-11-15 21:48:13,512 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 21:48:13,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=163, Invalid=1464, Unknown=13, NotChecked=0, Total=1640 [2019-11-15 21:48:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 21:48:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 137. [2019-11-15 21:48:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 21:48:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2019-11-15 21:48:13,519 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 56 [2019-11-15 21:48:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:13,519 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2019-11-15 21:48:13,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:48:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2019-11-15 21:48:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:48:13,520 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:13,520 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:13,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:48:13,724 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:48:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash 113704846, now seen corresponding path program 1 times [2019-11-15 21:48:13,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:13,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501997221] [2019-11-15 21:48:13,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:13,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:13,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:14,760 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 21:48:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:48:14,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501997221] [2019-11-15 21:48:14,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436929788] [2019-11-15 21:48:14,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:48:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:14,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-15 21:48:14,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:48:14,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:48:14,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:48:14,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:48:14,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:48:14,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:48:15,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 21:48:15,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:48:15,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:48:15,522 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_5| vanished before elimination [2019-11-15 21:48:15,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:48:15,526 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:48:15,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:48:15,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:48:15,533 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:10 [2019-11-15 21:48:24,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:48:24,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53 [2019-11-15 21:48:24,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:48:24,526 INFO L567 ElimStorePlain]: treesize reduction 26, result has 77.8 percent of original size [2019-11-15 21:48:24,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-11-15 21:48:24,540 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:48:24,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:48:24,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-11-15 21:48:24,571 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:48:24,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:48:24,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:48:24,592 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:100, output treesize:69 [2019-11-15 21:48:24,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2019-11-15 21:48:24,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:48:24,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:48:24,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:48:24,710 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 21:48:24,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2019-11-15 21:48:24,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:48:24,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:48:24,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:48:24,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:17 [2019-11-15 21:48:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:48:24,847 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:48:24,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2019-11-15 21:48:24,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790472163] [2019-11-15 21:48:24,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 21:48:24,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:24,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 21:48:24,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1686, Unknown=4, NotChecked=0, Total=1806 [2019-11-15 21:48:24,849 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand 43 states. [2019-11-15 21:48:25,431 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 21:48:42,544 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 21:48:42,860 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-15 21:48:47,284 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2019-11-15 21:49:11,795 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 67 [2019-11-15 21:49:12,295 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 72 [2019-11-15 21:49:12,803 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 72 [2019-11-15 21:49:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:33,953 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2019-11-15 21:49:33,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 21:49:33,955 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 56 [2019-11-15 21:49:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:33,956 INFO L225 Difference]: With dead ends: 194 [2019-11-15 21:49:33,956 INFO L226 Difference]: Without dead ends: 194 [2019-11-15 21:49:33,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=269, Invalid=3256, Unknown=15, NotChecked=0, Total=3540 [2019-11-15 21:49:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-15 21:49:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 137. [2019-11-15 21:49:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 21:49:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2019-11-15 21:49:33,962 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 56 [2019-11-15 21:49:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:33,963 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2019-11-15 21:49:33,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 21:49:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2019-11-15 21:49:33,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:49:33,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:33,964 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:34,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:49:34,168 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:49:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash -770118634, now seen corresponding path program 1 times [2019-11-15 21:49:34,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:34,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083313125] [2019-11-15 21:49:34,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:34,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:34,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:49:34,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083313125] [2019-11-15 21:49:34,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:34,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:49:34,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772120017] [2019-11-15 21:49:34,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:49:34,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:49:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:49:34,248 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand 5 states. [2019-11-15 21:49:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:34,580 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2019-11-15 21:49:34,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:34,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-15 21:49:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:34,581 INFO L225 Difference]: With dead ends: 154 [2019-11-15 21:49:34,582 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 21:49:34,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:49:34,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 21:49:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2019-11-15 21:49:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 21:49:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2019-11-15 21:49:34,586 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 57 [2019-11-15 21:49:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:34,587 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2019-11-15 21:49:34,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:49:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2019-11-15 21:49:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 21:49:34,588 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:34,588 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:34,588 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:49:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1348056997, now seen corresponding path program 1 times [2019-11-15 21:49:34,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:34,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182560506] [2019-11-15 21:49:34,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:34,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:34,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:49:34,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182560506] [2019-11-15 21:49:34,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:34,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:49:34,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252874931] [2019-11-15 21:49:34,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:49:34,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:34,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:49:34,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:49:34,712 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 8 states. [2019-11-15 21:49:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:35,115 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2019-11-15 21:49:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:49:35,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-11-15 21:49:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:35,117 INFO L225 Difference]: With dead ends: 149 [2019-11-15 21:49:35,117 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 21:49:35,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:49:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 21:49:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2019-11-15 21:49:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 21:49:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2019-11-15 21:49:35,122 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 59 [2019-11-15 21:49:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:35,122 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2019-11-15 21:49:35,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:49:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2019-11-15 21:49:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 21:49:35,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:35,123 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:35,123 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:49:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1349196744, now seen corresponding path program 1 times [2019-11-15 21:49:35,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:35,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297642420] [2019-11-15 21:49:35,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:35,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:35,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:49:35,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297642420] [2019-11-15 21:49:35,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:35,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:49:35,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323477565] [2019-11-15 21:49:35,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:49:35,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:35,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:49:35,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:49:35,239 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 7 states. [2019-11-15 21:49:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:35,718 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2019-11-15 21:49:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:49:35,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-11-15 21:49:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:35,719 INFO L225 Difference]: With dead ends: 148 [2019-11-15 21:49:35,720 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 21:49:35,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:49:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 21:49:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2019-11-15 21:49:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 21:49:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-15 21:49:35,724 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 59 [2019-11-15 21:49:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:35,724 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-15 21:49:35,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:49:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-15 21:49:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:49:35,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:35,725 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:35,726 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:49:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1159904520, now seen corresponding path program 1 times [2019-11-15 21:49:35,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:35,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850397738] [2019-11-15 21:49:35,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:35,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:35,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:49:35,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850397738] [2019-11-15 21:49:35,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:35,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:49:35,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126078622] [2019-11-15 21:49:35,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:49:35,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:35,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:49:35,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:49:35,832 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 6 states. [2019-11-15 21:49:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:36,209 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2019-11-15 21:49:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:49:36,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 21:49:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:36,211 INFO L225 Difference]: With dead ends: 149 [2019-11-15 21:49:36,211 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 21:49:36,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:49:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 21:49:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 128. [2019-11-15 21:49:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 21:49:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2019-11-15 21:49:36,215 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 60 [2019-11-15 21:49:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:36,216 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2019-11-15 21:49:36,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:49:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2019-11-15 21:49:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:49:36,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:36,217 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:36,217 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:49:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1159904521, now seen corresponding path program 1 times [2019-11-15 21:49:36,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:36,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397271027] [2019-11-15 21:49:36,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:36,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:36,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:49:36,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397271027] [2019-11-15 21:49:36,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:36,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:49:36,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633419701] [2019-11-15 21:49:36,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:49:36,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:49:36,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:49:36,353 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 6 states. [2019-11-15 21:49:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:36,885 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2019-11-15 21:49:36,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:49:36,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 21:49:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:36,887 INFO L225 Difference]: With dead ends: 146 [2019-11-15 21:49:36,887 INFO L226 Difference]: Without dead ends: 146 [2019-11-15 21:49:36,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:49:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-15 21:49:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2019-11-15 21:49:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 21:49:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-15 21:49:36,891 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 60 [2019-11-15 21:49:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:36,892 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-15 21:49:36,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:49:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-15 21:49:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:49:36,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:36,893 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:36,893 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:49:36,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1597301865, now seen corresponding path program 1 times [2019-11-15 21:49:36,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:36,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878503040] [2019-11-15 21:49:36,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:36,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:36,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 21:49:37,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878503040] [2019-11-15 21:49:37,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:37,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:49:37,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253173151] [2019-11-15 21:49:37,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:49:37,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:37,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:49:37,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:49:37,021 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2019-11-15 21:49:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:37,537 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2019-11-15 21:49:37,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:49:37,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-11-15 21:49:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:37,539 INFO L225 Difference]: With dead ends: 140 [2019-11-15 21:49:37,539 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 21:49:37,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:49:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 21:49:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 121. [2019-11-15 21:49:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 21:49:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2019-11-15 21:49:37,543 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 61 [2019-11-15 21:49:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:37,543 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2019-11-15 21:49:37,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:49:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2019-11-15 21:49:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:49:37,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:37,544 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:37,545 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:49:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:37,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1597301866, now seen corresponding path program 1 times [2019-11-15 21:49:37,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:37,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536920930] [2019-11-15 21:49:37,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:37,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:37,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 21:49:37,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536920930] [2019-11-15 21:49:37,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:37,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:49:37,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174956821] [2019-11-15 21:49:37,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:49:37,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:49:37,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:49:37,718 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 9 states. [2019-11-15 21:49:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:38,276 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2019-11-15 21:49:38,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:49:38,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-11-15 21:49:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:38,277 INFO L225 Difference]: With dead ends: 134 [2019-11-15 21:49:38,277 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 21:49:38,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:49:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 21:49:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2019-11-15 21:49:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 21:49:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2019-11-15 21:49:38,283 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 61 [2019-11-15 21:49:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:38,283 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2019-11-15 21:49:38,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:49:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2019-11-15 21:49:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:49:38,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:38,284 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:38,285 INFO L410 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:49:38,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:38,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1703771308, now seen corresponding path program 1 times [2019-11-15 21:49:38,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:38,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701794147] [2019-11-15 21:49:38,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:38,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:38,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:40,140 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 21:49:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:49:40,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701794147] [2019-11-15 21:49:40,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758135695] [2019-11-15 21:49:40,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:49:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:40,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 100 conjunts are in the unsatisfiable core [2019-11-15 21:49:40,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:49:40,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:40,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:49:40,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:40,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:40,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:40,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-15 21:49:40,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:49:40,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:40,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:40,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:40,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 21:49:40,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 21:49:40,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:40,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:40,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:40,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-11-15 21:49:40,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:40,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-11-15 21:49:40,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:40,848 INFO L567 ElimStorePlain]: treesize reduction 22, result has 63.3 percent of original size [2019-11-15 21:49:40,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:40,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-15 21:49:42,937 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-11-15 21:49:42,982 INFO L341 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-11-15 21:49:42,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 75 [2019-11-15 21:49:42,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:43,004 INFO L567 ElimStorePlain]: treesize reduction 58, result has 48.7 percent of original size [2019-11-15 21:49:43,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:43,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:55 [2019-11-15 21:49:43,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2019-11-15 21:49:43,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:43,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:43,543 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_5|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-11-15 21:49:43,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2019-11-15 21:49:43,546 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:43,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:43,647 INFO L341 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-15 21:49:43,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 87 [2019-11-15 21:49:43,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:43,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:43,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:43,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:43,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:43,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:43,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:43,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:43,653 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:43,697 INFO L567 ElimStorePlain]: treesize reduction 38, result has 47.9 percent of original size [2019-11-15 21:49:43,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:43,698 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:119, output treesize:31 [2019-11-15 21:49:48,395 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:48,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 159 [2019-11-15 21:49:48,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:48,546 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 21:49:48,546 INFO L567 ElimStorePlain]: treesize reduction 82, result has 70.9 percent of original size [2019-11-15 21:49:48,547 INFO L392 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_30|], 36=[|v_#memory_$Pointer$.base_BEFORE_CALL_9|]} [2019-11-15 21:49:48,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:48,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:48,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:48,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:48,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 115 [2019-11-15 21:49:48,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:48,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:48,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:48,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:48,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:48,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:48,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:48,996 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2019-11-15 21:49:48,996 INFO L341 Elim1Store]: treesize reduction 213, result has 64.3 percent of original size [2019-11-15 21:49:48,997 INFO L375 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 160 treesize of output 441 [2019-11-15 21:49:48,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:48,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:49,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:49,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:49,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:49,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:49,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:49,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:49,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:49:49,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:49,068 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:49,238 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 54 [2019-11-15 21:49:49,238 INFO L567 ElimStorePlain]: treesize reduction 424, result has 22.8 percent of original size [2019-11-15 21:49:49,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:49,240 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:180, output treesize:178 [2019-11-15 21:49:49,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:49,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:49,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 139 treesize of output 101 [2019-11-15 21:49:49,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:49,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:49,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:49,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:189, output treesize:142 [2019-11-15 21:49:49,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:50,062 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-11-15 21:49:50,063 INFO L341 Elim1Store]: treesize reduction 20, result has 88.7 percent of original size [2019-11-15 21:49:50,063 INFO L375 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 13 case distinctions, treesize of input 136 treesize of output 200 [2019-11-15 21:49:50,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,104 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:50,181 INFO L567 ElimStorePlain]: treesize reduction 124, result has 29.1 percent of original size [2019-11-15 21:49:50,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:50,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:146, output treesize:51 [2019-11-15 21:49:50,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:49:50,379 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:49:50,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 57 [2019-11-15 21:49:50,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199079377] [2019-11-15 21:49:50,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-15 21:49:50,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:50,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-15 21:49:50,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3126, Unknown=2, NotChecked=0, Total=3306 [2019-11-15 21:49:50,382 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 58 states. [2019-11-15 21:49:51,182 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 21:50:08,223 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-11-15 21:50:10,498 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-11-15 21:50:11,877 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-11-15 21:50:13,453 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-15 21:50:15,792 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 130 [2019-11-15 21:50:18,186 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 151 [2019-11-15 21:50:18,604 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-11-15 21:50:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:20,443 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2019-11-15 21:50:20,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 21:50:20,444 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 63 [2019-11-15 21:50:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:20,445 INFO L225 Difference]: With dead ends: 133 [2019-11-15 21:50:20,445 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 21:50:20,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=433, Invalid=6367, Unknown=6, NotChecked=0, Total=6806 [2019-11-15 21:50:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 21:50:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2019-11-15 21:50:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:50:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2019-11-15 21:50:20,450 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 63 [2019-11-15 21:50:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:20,450 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2019-11-15 21:50:20,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-15 21:50:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2019-11-15 21:50:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:50:20,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:20,451 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:50:20,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:50:20,658 INFO L410 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:50:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:20,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1703771309, now seen corresponding path program 1 times [2019-11-15 21:50:20,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:50:20,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039044673] [2019-11-15 21:50:20,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:50:20,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:50:20,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:50:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:23,510 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 21:50:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:50:23,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039044673] [2019-11-15 21:50:23,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561667900] [2019-11-15 21:50:23,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:50:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:23,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 116 conjunts are in the unsatisfiable core [2019-11-15 21:50:23,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:23,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:50:23,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:23,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:23,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:23,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:50:24,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:24,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 21:50:24,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:24,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:24,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:50:24,232 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:24,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,241 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-11-15 21:50:24,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:50:24,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:24,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:50:24,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:24,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,409 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-11-15 21:50:24,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 21:50:24,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:24,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 21:50:24,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:24,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:64 [2019-11-15 21:50:24,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:24,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:24,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 128 [2019-11-15 21:50:24,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,953 INFO L567 ElimStorePlain]: treesize reduction 92, result has 57.4 percent of original size [2019-11-15 21:50:24,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:24,958 INFO L375 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 59 treesize of output 52 [2019-11-15 21:50:24,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:24,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:24,983 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:120 [2019-11-15 21:50:25,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:25,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:25,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:25,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 178 [2019-11-15 21:50:25,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:25,305 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-11-15 21:50:25,305 INFO L567 ElimStorePlain]: treesize reduction 100, result has 52.8 percent of original size [2019-11-15 21:50:25,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:25,320 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:25,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 72 [2019-11-15 21:50:25,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:25,383 INFO L567 ElimStorePlain]: treesize reduction 38, result has 74.0 percent of original size [2019-11-15 21:50:25,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:25,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:146, output treesize:204 [2019-11-15 21:50:26,286 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_23|], 1=[|v_#length_BEFORE_CALL_18|]} [2019-11-15 21:50:26,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-15 21:50:26,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:26,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:26,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 26 [2019-11-15 21:50:26,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:26,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:26,520 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 21:50:26,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:26,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 337 treesize of output 308 [2019-11-15 21:50:26,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:50:26,535 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:50:26,637 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:50:26,637 INFO L567 ElimStorePlain]: treesize reduction 144, result has 53.1 percent of original size [2019-11-15 21:50:26,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:50:26,839 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 21:50:26,842 INFO L168 Benchmark]: Toolchain (without parser) took 228664.24 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.1 MB). Free memory was 939.4 MB in the beginning and 1.3 GB in the end (delta: -332.8 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:50:26,842 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:50:26,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:50:26,842 INFO L168 Benchmark]: Boogie Preprocessor took 77.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:50:26,843 INFO L168 Benchmark]: RCFGBuilder took 903.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 80.0 MB). Peak memory consumption was 80.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:50:26,843 INFO L168 Benchmark]: TraceAbstraction took 227073.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -220.1 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:50:26,845 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 606.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 903.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 80.0 MB). Peak memory consumption was 80.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 227073.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -220.1 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:50:29,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:50:29,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:50:29,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:50:29,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:50:29,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:50:29,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:50:29,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:50:29,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:50:29,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:50:29,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:50:29,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:50:29,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:50:29,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:50:29,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:50:29,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:50:29,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:50:29,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:50:29,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:50:29,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:50:29,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:50:29,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:50:29,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:50:29,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:50:29,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:50:29,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:50:29,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:50:29,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:50:29,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:50:29,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:50:29,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:50:29,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:50:29,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:50:29,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:50:29,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:50:29,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:50:29,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:50:29,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:50:29,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:50:29,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:50:29,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:50:29,115 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 21:50:29,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:50:29,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:50:29,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:50:29,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:50:29,157 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:50:29,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:50:29,158 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:50:29,158 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:50:29,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:50:29,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:50:29,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:50:29,159 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:50:29,159 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:50:29,159 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:50:29,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:50:29,160 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:50:29,160 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:50:29,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:50:29,161 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:50:29,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:50:29,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:50:29,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:50:29,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:50:29,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:50:29,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:50:29,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:50:29,163 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:50:29,163 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:50:29,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:50:29,164 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/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 -> 9459b8edd4bc1a8100b2516dc16681291af0c7dd [2019-11-15 21:50:29,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:50:29,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:50:29,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:50:29,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:50:29,233 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:50:29,234 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2019-11-15 21:50:29,287 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data/dbb5c578b/abaa4e33c33c4f3a84248435ebf94f1c/FLAG8f2d54ed1 [2019-11-15 21:50:29,763 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:50:29,763 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2019-11-15 21:50:29,788 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data/dbb5c578b/abaa4e33c33c4f3a84248435ebf94f1c/FLAG8f2d54ed1 [2019-11-15 21:50:30,084 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/data/dbb5c578b/abaa4e33c33c4f3a84248435ebf94f1c [2019-11-15 21:50:30,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:50:30,088 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:50:30,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:50:30,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:50:30,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:50:30,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:50:30" (1/1) ... [2019-11-15 21:50:30,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b000ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30, skipping insertion in model container [2019-11-15 21:50:30,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:50:30" (1/1) ... [2019-11-15 21:50:30,102 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:50:30,149 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:50:30,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:50:30,604 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:50:30,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:50:30,746 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:50:30,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30 WrapperNode [2019-11-15 21:50:30,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:50:30,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:50:30,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:50:30,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:50:30,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30" (1/1) ... [2019-11-15 21:50:30,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30" (1/1) ... [2019-11-15 21:50:30,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30" (1/1) ... [2019-11-15 21:50:30,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30" (1/1) ... [2019-11-15 21:50:30,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30" (1/1) ... [2019-11-15 21:50:30,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30" (1/1) ... [2019-11-15 21:50:30,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30" (1/1) ... [2019-11-15 21:50:30,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:50:30,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:50:30,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:50:30,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:50:30,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:50:30,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:50:30,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:50:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:50:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:50:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:50:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 21:50:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-15 21:50:30,888 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-15 21:50:30,888 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_insert [2019-11-15 21:50:30,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:50:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:50:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:50:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:50:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:50:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:50:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:50:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:50:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:50:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:50:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:50:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:50:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:50:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:50:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:50:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:50:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:50:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:50:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:50:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:50:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:50:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:50:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:50:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:50:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:50:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:50:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:50:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:50:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:50:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:50:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:50:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:50:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:50:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:50:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:50:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:50:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:50:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:50:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:50:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:50:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:50:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:50:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:50:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:50:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:50:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:50:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:50:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:50:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:50:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:50:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:50:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:50:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:50:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:50:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:50:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:50:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:50:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:50:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:50:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:50:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:50:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:50:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:50:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:50:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:50:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:50:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:50:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:50:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:50:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:50:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:50:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:50:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:50:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:50:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:50:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:50:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:50:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:50:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:50:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:50:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:50:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:50:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:50:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:50:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:50:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:50:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:50:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:50:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:50:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:50:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:50:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:50:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:50:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:50:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:50:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:50:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:50:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:50:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:50:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:50:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:50:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:50:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:50:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:50:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:50:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:50:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:50:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:50:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 21:50:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:50:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:50:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:50:30,908 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-15 21:50:30,908 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-15 21:50:30,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:50:30,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:50:30,908 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_insert [2019-11-15 21:50:30,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:50:30,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:50:30,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:50:30,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:50:30,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:50:30,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:50:31,417 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:50:32,138 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:50:32,138 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 21:50:32,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:50:32 BoogieIcfgContainer [2019-11-15 21:50:32,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:50:32,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:50:32,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:50:32,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:50:32,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:50:30" (1/3) ... [2019-11-15 21:50:32,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278f24b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:50:32, skipping insertion in model container [2019-11-15 21:50:32,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:50:30" (2/3) ... [2019-11-15 21:50:32,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278f24b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:50:32, skipping insertion in model container [2019-11-15 21:50:32,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:50:32" (3/3) ... [2019-11-15 21:50:32,147 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2019-11-15 21:50:32,157 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:50:32,166 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-15 21:50:32,177 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-15 21:50:32,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:50:32,196 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:50:32,196 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:50:32,196 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:50:32,197 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:50:32,197 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:50:32,197 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:50:32,197 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:50:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2019-11-15 21:50:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:50:32,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:32,238 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:50:32,241 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-15 21:50:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash -799534984, now seen corresponding path program 1 times [2019-11-15 21:50:32,257 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:32,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [838855612] [2019-11-15 21:50:32,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fb994a4f-006b-4810-bdba-ea74d8e7e2fb/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:32,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:32,486 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:50:32,491 INFO L168 Benchmark]: Toolchain (without parser) took 2401.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -65.0 MB). Peak memory consumption was 79.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:50:32,492 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:50:32,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:50:32,494 INFO L168 Benchmark]: Boogie Preprocessor took 85.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:50:32,495 INFO L168 Benchmark]: RCFGBuilder took 1306.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.7 MB). Peak memory consumption was 83.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:50:32,495 INFO L168 Benchmark]: TraceAbstraction took 347.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:50:32,498 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.70 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 658.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1306.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.7 MB). Peak memory consumption was 83.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 347.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...