./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.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_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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 760c75961baa7cc196b373809e9a87dd0bcf8eb7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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 760c75961baa7cc196b373809e9a87dd0bcf8eb7 .............................................................................................................................................................................................................................................................................................................................................................. 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:18:17,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:18:17,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:18:17,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:18:17,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:18:17,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:18:17,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:18:17,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:18:17,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:18:17,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:18:17,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:18:17,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:18:17,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:18:17,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:18:17,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:18:17,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:18:17,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:18:17,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:18:17,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:18:17,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:18:17,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:18:17,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:18:17,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:18:17,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:18:17,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:18:17,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:18:17,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:18:17,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:18:17,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:18:17,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:18:17,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:18:17,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:18:17,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:18:17,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:18:17,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:18:17,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:18:17,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:18:17,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:18:17,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:18:17,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:18:17,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:18:17,305 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:18:17,329 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:18:17,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:18:17,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:18:17,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:18:17,331 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:18:17,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:18:17,331 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:18:17,332 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:18:17,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:18:17,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:18:17,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:18:17,332 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:18:17,333 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:18:17,333 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:18:17,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:18:17,333 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:18:17,333 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:18:17,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:18:17,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:18:17,334 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:18:17,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:18:17,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:18:17,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:18:17,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:18:17,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:18:17,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:18:17,335 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_ce941d04-bee8-47bd-bfab-3669085a240c/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 -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2019-11-15 21:18:17,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:18:17,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:18:17,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:18:17,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:18:17,386 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:18:17,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-11-15 21:18:17,434 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data/f41ea5f4d/5bb1ad47657e45e1b9ae1f0ee727a052/FLAGab3c76e6d [2019-11-15 21:18:17,878 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:18:17,879 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-11-15 21:18:17,891 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data/f41ea5f4d/5bb1ad47657e45e1b9ae1f0ee727a052/FLAGab3c76e6d [2019-11-15 21:18:18,232 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data/f41ea5f4d/5bb1ad47657e45e1b9ae1f0ee727a052 [2019-11-15 21:18:18,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:18:18,235 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:18:18,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:18:18,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:18:18,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:18:18,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:18:18" (1/1) ... [2019-11-15 21:18:18,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763061cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18, skipping insertion in model container [2019-11-15 21:18:18,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:18:18" (1/1) ... [2019-11-15 21:18:18,247 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:18:18,289 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:18:18,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:18:18,609 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:18:18,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:18:18,696 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:18:18,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18 WrapperNode [2019-11-15 21:18:18,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:18:18,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:18:18,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:18:18,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:18:18,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18" (1/1) ... [2019-11-15 21:18:18,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18" (1/1) ... [2019-11-15 21:18:18,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18" (1/1) ... [2019-11-15 21:18:18,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18" (1/1) ... [2019-11-15 21:18:18,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18" (1/1) ... [2019-11-15 21:18:18,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18" (1/1) ... [2019-11-15 21:18:18,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18" (1/1) ... [2019-11-15 21:18:18,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:18:18,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:18:18,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:18:18,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:18:18,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:18:18,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:18:18,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:18:18,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:18:18,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:18:18,829 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:18:18,829 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-15 21:18:18,830 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2019-11-15 21:18:18,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:18:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:18:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:18:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:18:18,832 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:18:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:18:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:18:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:18:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:18:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:18:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:18:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:18:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:18:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:18:18,836 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:18:18,837 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:18:18,837 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:18:18,837 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:18:18,837 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:18:18,837 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:18:18,837 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:18:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:18:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:18:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:18:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:18:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:18:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:18:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:18:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:18:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:18:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:18:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:18:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:18:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:18:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:18:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:18:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:18:18,841 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:18:18,841 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:18:18,843 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:18:18,843 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:18:18,843 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:18:18,843 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:18:18,843 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:18:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:18:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:18:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:18:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:18:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:18:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:18:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:18:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:18:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:18:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:18:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:18:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:18:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:18:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:18:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:18:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:18:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:18:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:18:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:18:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:18:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:18:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:18:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:18:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:18:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:18:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:18:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:18:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:18:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:18:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:18:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:18:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:18:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:18:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:18:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:18:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:18:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:18:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:18:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:18:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:18:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:18:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:18:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:18:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:18:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:18:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:18:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:18:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:18:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:18:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:18:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:18:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:18:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:18:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:18:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:18:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:18:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:18:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:18:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:18:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:18:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:18:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:18:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:18:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:18:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-15 21:18:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:18:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:18:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2019-11-15 21:18:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:18:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:18:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:18:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:18:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:18:19,517 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:18:19,543 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:18:19,543 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-15 21:18:19,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:18:19 BoogieIcfgContainer [2019-11-15 21:18:19,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:18:19,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:18:19,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:18:19,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:18:19,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:18:18" (1/3) ... [2019-11-15 21:18:19,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd9fb5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:18:19, skipping insertion in model container [2019-11-15 21:18:19,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:18:18" (2/3) ... [2019-11-15 21:18:19,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd9fb5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:18:19, skipping insertion in model container [2019-11-15 21:18:19,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:18:19" (3/3) ... [2019-11-15 21:18:19,556 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2019-11-15 21:18:19,563 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:18:19,570 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2019-11-15 21:18:19,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2019-11-15 21:18:19,600 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:18:19,600 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:18:19,600 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:18:19,600 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:18:19,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:18:19,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:18:19,601 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:18:19,601 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:18:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-15 21:18:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:18:19,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:19,637 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:19,644 INFO L410 AbstractCegarLoop]: === Iteration 1 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:19,649 INFO L82 PathProgramCache]: Analyzing trace with hash 336039556, now seen corresponding path program 1 times [2019-11-15 21:18:19,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:19,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752139743] [2019-11-15 21:18:19,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:19,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:19,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:19,850 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:18:19,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752139743] [2019-11-15 21:18:19,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:19,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:18:19,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053510513] [2019-11-15 21:18:19,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:18:19,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:19,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:18:19,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:18:19,873 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 4 states. [2019-11-15 21:18:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:20,248 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2019-11-15 21:18:20,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:18:20,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 21:18:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:20,265 INFO L225 Difference]: With dead ends: 143 [2019-11-15 21:18:20,265 INFO L226 Difference]: Without dead ends: 136 [2019-11-15 21:18:20,266 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:18:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-15 21:18:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-15 21:18:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-15 21:18:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2019-11-15 21:18:20,320 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 10 [2019-11-15 21:18:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:20,321 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2019-11-15 21:18:20,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:18:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2019-11-15 21:18:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:18:20,321 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:20,322 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:20,323 INFO L410 AbstractCegarLoop]: === Iteration 2 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:20,323 INFO L82 PathProgramCache]: Analyzing trace with hash 336039557, now seen corresponding path program 1 times [2019-11-15 21:18:20,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:20,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123078590] [2019-11-15 21:18:20,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:20,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:20,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:20,403 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:18:20,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123078590] [2019-11-15 21:18:20,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:20,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:18:20,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843353254] [2019-11-15 21:18:20,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:18:20,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:18:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:18:20,406 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 4 states. [2019-11-15 21:18:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:20,790 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-15 21:18:20,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:18:20,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 21:18:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:20,792 INFO L225 Difference]: With dead ends: 133 [2019-11-15 21:18:20,792 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 21:18:20,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:18:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 21:18:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-15 21:18:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 21:18:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-11-15 21:18:20,804 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 10 [2019-11-15 21:18:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:20,805 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-11-15 21:18:20,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:18:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-11-15 21:18:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:18:20,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:20,806 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:20,807 INFO L410 AbstractCegarLoop]: === Iteration 3 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:20,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1885452530, now seen corresponding path program 1 times [2019-11-15 21:18:20,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:20,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486386345] [2019-11-15 21:18:20,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:20,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:20,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:20,863 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:18:20,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486386345] [2019-11-15 21:18:20,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:20,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:18:20,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675176735] [2019-11-15 21:18:20,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:18:20,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:18:20,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:18:20,865 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 4 states. [2019-11-15 21:18:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:21,134 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2019-11-15 21:18:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:18:21,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-15 21:18:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:21,137 INFO L225 Difference]: With dead ends: 140 [2019-11-15 21:18:21,137 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 21:18:21,138 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:18:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 21:18:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2019-11-15 21:18:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 21:18:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2019-11-15 21:18:21,148 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 15 [2019-11-15 21:18:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:21,149 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2019-11-15 21:18:21,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:18:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2019-11-15 21:18:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:18:21,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:21,150 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:21,151 INFO L410 AbstractCegarLoop]: === Iteration 4 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1885452529, now seen corresponding path program 1 times [2019-11-15 21:18:21,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:21,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795695121] [2019-11-15 21:18:21,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:21,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:21,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:21,225 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:18:21,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795695121] [2019-11-15 21:18:21,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:21,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:18:21,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619862468] [2019-11-15 21:18:21,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:18:21,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:21,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:18:21,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:18:21,230 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 4 states. [2019-11-15 21:18:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:21,463 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-15 21:18:21,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:18:21,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-15 21:18:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:21,465 INFO L225 Difference]: With dead ends: 139 [2019-11-15 21:18:21,465 INFO L226 Difference]: Without dead ends: 139 [2019-11-15 21:18:21,465 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:18:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-15 21:18:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2019-11-15 21:18:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 21:18:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-11-15 21:18:21,473 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 15 [2019-11-15 21:18:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:21,473 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-11-15 21:18:21,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:18:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-11-15 21:18:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:18:21,474 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:21,474 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:21,475 INFO L410 AbstractCegarLoop]: === Iteration 5 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1885454067, now seen corresponding path program 1 times [2019-11-15 21:18:21,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:21,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608072752] [2019-11-15 21:18:21,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:21,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:21,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:21,566 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:18:21,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608072752] [2019-11-15 21:18:21,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:21,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:18:21,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958586799] [2019-11-15 21:18:21,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:18:21,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:21,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:18:21,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:18:21,568 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 6 states. [2019-11-15 21:18:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:21,899 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-15 21:18:21,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:18:21,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 21:18:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:21,901 INFO L225 Difference]: With dead ends: 139 [2019-11-15 21:18:21,901 INFO L226 Difference]: Without dead ends: 139 [2019-11-15 21:18:21,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:18:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-15 21:18:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-11-15 21:18:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 21:18:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2019-11-15 21:18:21,910 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 15 [2019-11-15 21:18:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:21,937 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2019-11-15 21:18:21,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:18:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2019-11-15 21:18:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:18:21,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:21,938 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:21,939 INFO L410 AbstractCegarLoop]: === Iteration 6 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1885454066, now seen corresponding path program 1 times [2019-11-15 21:18:21,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:21,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414107271] [2019-11-15 21:18:21,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:21,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:21,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:22,002 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:18:22,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414107271] [2019-11-15 21:18:22,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:22,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:18:22,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92089386] [2019-11-15 21:18:22,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:18:22,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:18:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:18:22,004 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 6 states. [2019-11-15 21:18:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:22,279 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2019-11-15 21:18:22,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:18:22,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 21:18:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:22,281 INFO L225 Difference]: With dead ends: 137 [2019-11-15 21:18:22,281 INFO L226 Difference]: Without dead ends: 137 [2019-11-15 21:18:22,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:18:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-15 21:18:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-11-15 21:18:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-15 21:18:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2019-11-15 21:18:22,288 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 15 [2019-11-15 21:18:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:22,288 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2019-11-15 21:18:22,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:18:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2019-11-15 21:18:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 21:18:22,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:22,289 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:22,290 INFO L410 AbstractCegarLoop]: === Iteration 7 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1680513841, now seen corresponding path program 1 times [2019-11-15 21:18:22,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:22,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847197763] [2019-11-15 21:18:22,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:22,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:22,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:22,362 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:18:22,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847197763] [2019-11-15 21:18:22,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:22,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:18:22,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902432268] [2019-11-15 21:18:22,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:18:22,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:18:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:18:22,364 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 5 states. [2019-11-15 21:18:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:22,580 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2019-11-15 21:18:22,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:18:22,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-15 21:18:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:22,582 INFO L225 Difference]: With dead ends: 136 [2019-11-15 21:18:22,582 INFO L226 Difference]: Without dead ends: 136 [2019-11-15 21:18:22,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:18:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-15 21:18:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-11-15 21:18:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-15 21:18:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2019-11-15 21:18:22,587 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 16 [2019-11-15 21:18:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:22,588 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2019-11-15 21:18:22,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:18:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2019-11-15 21:18:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:18:22,588 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:22,589 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:18:22,589 INFO L410 AbstractCegarLoop]: === Iteration 8 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:22,590 INFO L82 PathProgramCache]: Analyzing trace with hash -901390365, now seen corresponding path program 1 times [2019-11-15 21:18:22,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:22,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400431181] [2019-11-15 21:18:22,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:22,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:22,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:22,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400431181] [2019-11-15 21:18:22,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:22,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:18:22,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485750454] [2019-11-15 21:18:22,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:18:22,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:22,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:18:22,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:18:22,667 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 5 states. [2019-11-15 21:18:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:22,955 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-15 21:18:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:18:22,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-15 21:18:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:22,957 INFO L225 Difference]: With dead ends: 133 [2019-11-15 21:18:22,957 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 21:18:22,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:18:22,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 21:18:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-15 21:18:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 21:18:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-11-15 21:18:22,962 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 20 [2019-11-15 21:18:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:22,962 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-11-15 21:18:22,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:18:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-11-15 21:18:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:18:22,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:22,963 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:18:22,964 INFO L410 AbstractCegarLoop]: === Iteration 9 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash -901390364, now seen corresponding path program 1 times [2019-11-15 21:18:22,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:22,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147087283] [2019-11-15 21:18:22,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:22,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:22,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:23,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147087283] [2019-11-15 21:18:23,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750538142] [2019-11-15 21:18:23,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:18:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:23,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:18:23,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:23,203 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:23,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-11-15 21:18:23,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556468618] [2019-11-15 21:18:23,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:18:23,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:18:23,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:18:23,204 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 7 states. [2019-11-15 21:18:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:23,514 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-11-15 21:18:23,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:18:23,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-15 21:18:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:23,515 INFO L225 Difference]: With dead ends: 135 [2019-11-15 21:18:23,516 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 21:18:23,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:18:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 21:18:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-15 21:18:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-15 21:18:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2019-11-15 21:18:23,520 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 20 [2019-11-15 21:18:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:23,521 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2019-11-15 21:18:23,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:18:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2019-11-15 21:18:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:18:23,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:23,522 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:23,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:23,726 INFO L410 AbstractCegarLoop]: === Iteration 10 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:23,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:23,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2121717531, now seen corresponding path program 1 times [2019-11-15 21:18:23,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:23,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911622773] [2019-11-15 21:18:23,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:23,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:23,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:23,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911622773] [2019-11-15 21:18:23,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985937718] [2019-11-15 21:18:23,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:18:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:23,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 21:18:23,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:23,962 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:18:23,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:23,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:23,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:23,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:18:24,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:24,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:18:24,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:24,028 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 21:18:24,028 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:18:24,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-15 21:18:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:24,040 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:24,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 21:18:24,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495033832] [2019-11-15 21:18:24,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:18:24,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:24,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:18:24,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:18:24,042 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 6 states. [2019-11-15 21:18:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:24,291 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-15 21:18:24,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:18:24,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-15 21:18:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:24,293 INFO L225 Difference]: With dead ends: 133 [2019-11-15 21:18:24,293 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 21:18:24,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:18:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 21:18:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-15 21:18:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 21:18:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-11-15 21:18:24,297 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 21 [2019-11-15 21:18:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:24,298 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-11-15 21:18:24,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:18:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-11-15 21:18:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:18:24,299 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:24,299 INFO L380 BasicCegarLoop]: trace histogram [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:18:24,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:24,503 INFO L410 AbstractCegarLoop]: === Iteration 11 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:24,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:24,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1175479222, now seen corresponding path program 1 times [2019-11-15 21:18:24,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:24,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037836146] [2019-11-15 21:18:24,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:24,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:24,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:18:24,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037836146] [2019-11-15 21:18:24,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:24,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:18:24,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429812069] [2019-11-15 21:18:24,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:18:24,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:24,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:18:24,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:18:24,684 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 11 states. [2019-11-15 21:18:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:25,349 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2019-11-15 21:18:25,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:18:25,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-11-15 21:18:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:25,350 INFO L225 Difference]: With dead ends: 130 [2019-11-15 21:18:25,351 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 21:18:25,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:18:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 21:18:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-15 21:18:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 21:18:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2019-11-15 21:18:25,355 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 32 [2019-11-15 21:18:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:25,355 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2019-11-15 21:18:25,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:18:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2019-11-15 21:18:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:18:25,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:25,356 INFO L380 BasicCegarLoop]: trace histogram [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:18:25,357 INFO L410 AbstractCegarLoop]: === Iteration 12 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:25,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1175479221, now seen corresponding path program 1 times [2019-11-15 21:18:25,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:25,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878218580] [2019-11-15 21:18:25,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:25,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:25,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:18:25,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878218580] [2019-11-15 21:18:25,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:25,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:18:25,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614763120] [2019-11-15 21:18:25,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:18:25,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:25,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:18:25,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:18:25,596 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand 11 states. [2019-11-15 21:18:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:26,276 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-11-15 21:18:26,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:18:26,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-11-15 21:18:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:26,277 INFO L225 Difference]: With dead ends: 123 [2019-11-15 21:18:26,278 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 21:18:26,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:18:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 21:18:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-11-15 21:18:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 21:18:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2019-11-15 21:18:26,284 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 32 [2019-11-15 21:18:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:26,284 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2019-11-15 21:18:26,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:18:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2019-11-15 21:18:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 21:18:26,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:26,291 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:26,292 INFO L410 AbstractCegarLoop]: === Iteration 13 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:26,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1282426124, now seen corresponding path program 1 times [2019-11-15 21:18:26,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:26,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234059036] [2019-11-15 21:18:26,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:26,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:26,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:26,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234059036] [2019-11-15 21:18:26,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397829546] [2019-11-15 21:18:26,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:18:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:27,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-15 21:18:27,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:27,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:27,123 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:18:27,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:27,147 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-15 21:18:27,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:27,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-15 21:18:27,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:27,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-15 21:18:27,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:27,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:27,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:27,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2019-11-15 21:18:27,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:18:27,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:27,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:27,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:27,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-11-15 21:18:27,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-11-15 21:18:27,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:27,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:27,433 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:18:27,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2019-11-15 21:18:27,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:27,574 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 1 case distinctions, treesize of input 39 treesize of output 60 [2019-11-15 21:18:27,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:27,612 INFO L567 ElimStorePlain]: treesize reduction 42, result has 53.8 percent of original size [2019-11-15 21:18:27,613 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:18:27,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2019-11-15 21:18:27,713 INFO L341 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2019-11-15 21:18:27,713 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 2 case distinctions, treesize of input 48 treesize of output 60 [2019-11-15 21:18:27,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:27,750 INFO L567 ElimStorePlain]: treesize reduction 22, result has 72.5 percent of original size [2019-11-15 21:18:27,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:27,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:67 [2019-11-15 21:18:28,196 INFO L341 Elim1Store]: treesize reduction 11, result has 52.2 percent of original size [2019-11-15 21:18:28,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 42 [2019-11-15 21:18:28,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:28,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:28,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:28,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:74, output treesize:7 [2019-11-15 21:18:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:28,232 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:28,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2019-11-15 21:18:28,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415222843] [2019-11-15 21:18:28,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 21:18:28,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 21:18:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 21:18:28,235 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 37 states. [2019-11-15 21:18:29,677 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-11-15 21:18:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:30,759 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-11-15 21:18:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 21:18:30,760 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 38 [2019-11-15 21:18:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:30,761 INFO L225 Difference]: With dead ends: 121 [2019-11-15 21:18:30,761 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 21:18:30,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=365, Invalid=2605, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 21:18:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 21:18:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-11-15 21:18:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 21:18:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2019-11-15 21:18:30,766 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 38 [2019-11-15 21:18:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:30,766 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2019-11-15 21:18:30,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 21:18:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2019-11-15 21:18:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 21:18:30,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:30,767 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:30,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:30,968 INFO L410 AbstractCegarLoop]: === Iteration 14 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:30,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1282424908, now seen corresponding path program 1 times [2019-11-15 21:18:30,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:30,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607961819] [2019-11-15 21:18:30,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:30,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:30,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:18:31,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607961819] [2019-11-15 21:18:31,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:31,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:18:31,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292616003] [2019-11-15 21:18:31,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:18:31,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:31,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:18:31,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:18:31,257 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 15 states. [2019-11-15 21:18:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:31,827 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-11-15 21:18:31,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:18:31,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-11-15 21:18:31,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:31,829 INFO L225 Difference]: With dead ends: 114 [2019-11-15 21:18:31,829 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 21:18:31,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:18:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 21:18:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-15 21:18:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:18:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-11-15 21:18:31,832 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 38 [2019-11-15 21:18:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:31,833 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-11-15 21:18:31,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:18:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-11-15 21:18:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 21:18:31,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:31,834 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:31,834 INFO L410 AbstractCegarLoop]: === Iteration 15 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:31,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:31,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1282463890, now seen corresponding path program 1 times [2019-11-15 21:18:31,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:31,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387867211] [2019-11-15 21:18:31,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:31,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:31,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:18:32,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387867211] [2019-11-15 21:18:32,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:32,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:18:32,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32768874] [2019-11-15 21:18:32,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:18:32,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:32,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:18:32,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:18:32,019 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 11 states. [2019-11-15 21:18:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:32,458 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-11-15 21:18:32,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:18:32,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-11-15 21:18:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:32,459 INFO L225 Difference]: With dead ends: 109 [2019-11-15 21:18:32,459 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 21:18:32,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:18:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 21:18:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-15 21:18:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 21:18:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-11-15 21:18:32,463 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 38 [2019-11-15 21:18:32,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:32,463 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-11-15 21:18:32,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:18:32,463 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-11-15 21:18:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:18:32,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:32,464 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:32,464 INFO L410 AbstractCegarLoop]: === Iteration 16 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:32,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1100504094, now seen corresponding path program 1 times [2019-11-15 21:18:32,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:32,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002315400] [2019-11-15 21:18:32,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:32,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:32,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:32,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002315400] [2019-11-15 21:18:32,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421385642] [2019-11-15 21:18:32,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:18:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:33,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 21:18:33,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:33,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:33,114 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:18:33,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,132 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 21:18:33,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-15 21:18:33,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:33,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-15 21:18:33,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:33,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-15 21:18:33,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:18:33,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:33,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 21:18:33,266 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:33,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-15 21:18:33,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:33,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:33,276 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:18:33,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2019-11-15 21:18:33,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:33,382 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 42 treesize of output 83 [2019-11-15 21:18:33,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,407 INFO L567 ElimStorePlain]: treesize reduction 64, result has 39.6 percent of original size [2019-11-15 21:18:33,407 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:18:33,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2019-11-15 21:18:33,500 INFO L341 Elim1Store]: treesize reduction 34, result has 65.7 percent of original size [2019-11-15 21:18:33,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 99 [2019-11-15 21:18:33,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,524 INFO L567 ElimStorePlain]: treesize reduction 46, result has 52.6 percent of original size [2019-11-15 21:18:33,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:33,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:54 [2019-11-15 21:18:33,969 INFO L341 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-15 21:18:33,970 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 61 treesize of output 99 [2019-11-15 21:18:33,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:33,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:33,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:33,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:33,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:33,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:33,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:33,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:33,976 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:33,996 INFO L567 ElimStorePlain]: treesize reduction 56, result has 23.3 percent of original size [2019-11-15 21:18:33,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:33,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:5 [2019-11-15 21:18:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:34,007 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:34,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2019-11-15 21:18:34,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621508400] [2019-11-15 21:18:34,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 21:18:34,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:34,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 21:18:34,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 21:18:34,009 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 33 states. [2019-11-15 21:18:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:36,373 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-11-15 21:18:36,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 21:18:36,374 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-11-15 21:18:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:36,375 INFO L225 Difference]: With dead ends: 109 [2019-11-15 21:18:36,375 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 21:18:36,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=2368, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 21:18:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 21:18:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-11-15 21:18:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 21:18:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2019-11-15 21:18:36,379 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 39 [2019-11-15 21:18:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:36,379 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2019-11-15 21:18:36,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 21:18:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2019-11-15 21:18:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:18:36,380 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:36,380 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:36,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:36,581 INFO L410 AbstractCegarLoop]: === Iteration 17 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:36,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1100466360, now seen corresponding path program 1 times [2019-11-15 21:18:36,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:36,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784311805] [2019-11-15 21:18:36,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:36,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:36,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:18:36,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784311805] [2019-11-15 21:18:36,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:36,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:18:36,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871107046] [2019-11-15 21:18:36,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:18:36,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:36,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:18:36,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:18:36,885 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 15 states. [2019-11-15 21:18:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:37,839 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-11-15 21:18:37,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:18:37,839 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-11-15 21:18:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:37,840 INFO L225 Difference]: With dead ends: 100 [2019-11-15 21:18:37,840 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 21:18:37,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:18:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 21:18:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-15 21:18:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 21:18:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-15 21:18:37,844 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 39 [2019-11-15 21:18:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:37,844 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-15 21:18:37,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:18:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-15 21:18:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:18:37,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:37,845 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:37,845 INFO L410 AbstractCegarLoop]: === Iteration 18 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:37,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash 244111542, now seen corresponding path program 1 times [2019-11-15 21:18:37,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:37,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330592322] [2019-11-15 21:18:37,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:37,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:37,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:38,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330592322] [2019-11-15 21:18:38,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251879580] [2019-11-15 21:18:38,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:18:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:38,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-15 21:18:38,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:38,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:38,535 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:18:38,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:38,548 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:18:38,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:38,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 21:18:38,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:38,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-15 21:18:38,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:38,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:38,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:38,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2019-11-15 21:18:38,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:18:38,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:38,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:38,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:38,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-15 21:18:38,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:38,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-15 21:18:38,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:38,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:38,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:38,687 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:18:38,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2019-11-15 21:18:38,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:38,817 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 42 treesize of output 83 [2019-11-15 21:18:38,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:38,857 INFO L567 ElimStorePlain]: treesize reduction 64, result has 42.3 percent of original size [2019-11-15 21:18:38,857 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:18:38,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-11-15 21:18:38,955 INFO L341 Elim1Store]: treesize reduction 34, result has 65.7 percent of original size [2019-11-15 21:18:38,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 99 [2019-11-15 21:18:38,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:38,983 INFO L567 ElimStorePlain]: treesize reduction 46, result has 54.9 percent of original size [2019-11-15 21:18:38,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:38,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:65 [2019-11-15 21:18:39,411 INFO L341 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-15 21:18:39,412 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 72 treesize of output 104 [2019-11-15 21:18:39,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:39,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:39,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:39,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:39,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:39,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:39,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:39,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:39,415 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:39,431 INFO L567 ElimStorePlain]: treesize reduction 56, result has 25.3 percent of original size [2019-11-15 21:18:39,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:39,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:11 [2019-11-15 21:18:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:39,449 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:39,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 31 [2019-11-15 21:18:39,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800558125] [2019-11-15 21:18:39,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 21:18:39,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 21:18:39,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2019-11-15 21:18:39,450 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 32 states. [2019-11-15 21:18:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:41,287 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-11-15 21:18:41,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:18:41,288 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-15 21:18:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:41,288 INFO L225 Difference]: With dead ends: 103 [2019-11-15 21:18:41,289 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 21:18:41,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=332, Invalid=2320, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 21:18:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 21:18:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-11-15 21:18:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 21:18:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-11-15 21:18:41,293 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 40 [2019-11-15 21:18:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:41,293 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-11-15 21:18:41,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 21:18:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-11-15 21:18:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:18:41,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:41,294 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:41,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:41,494 INFO L410 AbstractCegarLoop]: === Iteration 19 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:41,495 INFO L82 PathProgramCache]: Analyzing trace with hash 245281334, now seen corresponding path program 1 times [2019-11-15 21:18:41,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:41,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858918648] [2019-11-15 21:18:41,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:41,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:41,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:18:41,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858918648] [2019-11-15 21:18:41,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:18:41,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:18:41,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8573660] [2019-11-15 21:18:41,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:18:41,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:18:41,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:18:41,779 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 15 states. [2019-11-15 21:18:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:42,427 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2019-11-15 21:18:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:18:42,427 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-11-15 21:18:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:42,428 INFO L225 Difference]: With dead ends: 98 [2019-11-15 21:18:42,428 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 21:18:42,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:18:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 21:18:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-15 21:18:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 21:18:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-11-15 21:18:42,432 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 40 [2019-11-15 21:18:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:42,432 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-11-15 21:18:42,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:18:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-11-15 21:18:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:18:42,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:42,433 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:42,433 INFO L410 AbstractCegarLoop]: === Iteration 20 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2033890821, now seen corresponding path program 1 times [2019-11-15 21:18:42,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:42,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18667480] [2019-11-15 21:18:42,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:42,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:42,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:42,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18667480] [2019-11-15 21:18:42,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272125388] [2019-11-15 21:18:42,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:18:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:42,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 21:18:42,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:42,975 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 21:18:42,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:42,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:42,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:42,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:5 [2019-11-15 21:18:42,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:42,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:18:42,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:43,003 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 21:18:43,004 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:18:43,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-15 21:18:43,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:43,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:18:43,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:43,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:43,044 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:18:43,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2019-11-15 21:18:43,081 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:18:43,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:43,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:43,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:43,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-11-15 21:18:43,241 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:43,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2019-11-15 21:18:43,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:43,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:43,243 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:43,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:43,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:43,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:43,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2019-11-15 21:18:43,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:43,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:43,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:43,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:43,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 32 [2019-11-15 21:18:43,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:43,402 INFO L567 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-11-15 21:18:43,403 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:18:43,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-11-15 21:18:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:43,447 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:18:43,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2019-11-15 21:18:43,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777618086] [2019-11-15 21:18:43,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 21:18:43,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:18:43,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 21:18:43,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2019-11-15 21:18:43,449 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 30 states. [2019-11-15 21:18:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:18:44,563 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-15 21:18:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:18:44,564 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2019-11-15 21:18:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:18:44,564 INFO L225 Difference]: With dead ends: 97 [2019-11-15 21:18:44,565 INFO L226 Difference]: Without dead ends: 97 [2019-11-15 21:18:44,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=189, Invalid=1533, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 21:18:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-15 21:18:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-11-15 21:18:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 21:18:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-11-15 21:18:44,568 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 43 [2019-11-15 21:18:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:18:44,569 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-11-15 21:18:44,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 21:18:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-11-15 21:18:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:18:44,569 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:18:44,569 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:18:44,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:18:44,773 INFO L410 AbstractCegarLoop]: === Iteration 21 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:18:44,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:18:44,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2033459845, now seen corresponding path program 1 times [2019-11-15 21:18:44,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:18:44,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234871027] [2019-11-15 21:18:44,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:44,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:18:44,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:18:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:18:45,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234871027] [2019-11-15 21:18:45,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934548850] [2019-11-15 21:18:45,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:18:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:18:45,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 21:18:45,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:18:45,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:45,558 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:18:45,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:45,572 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:18:45,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:45,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 21:18:45,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:45,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-15 21:18:45,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:45,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:45,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:45,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-11-15 21:18:45,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:18:45,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:45,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:45,654 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:18:45,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2019-11-15 21:18:45,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:45,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-15 21:18:45,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:45,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:45,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:45,751 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:18:45,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2019-11-15 21:18:45,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:45,877 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 42 treesize of output 83 [2019-11-15 21:18:45,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:45,911 INFO L567 ElimStorePlain]: treesize reduction 64, result has 45.3 percent of original size [2019-11-15 21:18:45,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:45,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:53 [2019-11-15 21:18:46,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:46,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 133 [2019-11-15 21:18:46,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:18:46,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:18:46,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,011 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:46,060 INFO L567 ElimStorePlain]: treesize reduction 62, result has 50.4 percent of original size [2019-11-15 21:18:46,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:46,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:66, output treesize:72 [2019-11-15 21:18:46,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:46,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:18:56,223 WARN L191 SmtUtils]: Spent 10.04 s on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-11-15 21:18:58,278 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 21:19:00,351 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 21:19:02,412 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 21:19:04,476 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 21:19:04,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:04,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 72 [2019-11-15 21:19:04,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,519 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:19:04,554 INFO L567 ElimStorePlain]: treesize reduction 26, result has 61.8 percent of original size [2019-11-15 21:19:04,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:19:04,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:43 [2019-11-15 21:19:04,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:04,749 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:04,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 32 [2019-11-15 21:19:04,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:04,763 INFO L567 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-11-15 21:19:04,764 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:19:04,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-11-15 21:19:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:19:04,836 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:19:04,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 35 [2019-11-15 21:19:04,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749275770] [2019-11-15 21:19:04,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 21:19:04,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:04,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 21:19:04,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 21:19:04,838 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 36 states. [2019-11-15 21:19:12,579 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 21:19:14,658 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-15 21:19:16,721 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-15 21:19:18,804 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 21:19:22,919 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-15 21:19:31,109 WARN L191 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-11-15 21:19:39,272 WARN L191 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-11-15 21:19:43,593 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-15 21:19:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:44,185 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-11-15 21:19:44,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:19:44,186 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2019-11-15 21:19:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:44,187 INFO L225 Difference]: With dead ends: 100 [2019-11-15 21:19:44,187 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 21:19:44,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=356, Invalid=3066, Unknown=0, NotChecked=0, Total=3422 [2019-11-15 21:19:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 21:19:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-11-15 21:19:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 21:19:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-11-15 21:19:44,191 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2019-11-15 21:19:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:44,191 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-11-15 21:19:44,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 21:19:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-11-15 21:19:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:19:44,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:44,192 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:44,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:44,393 INFO L410 AbstractCegarLoop]: === Iteration 22 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:19:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash -694753286, now seen corresponding path program 1 times [2019-11-15 21:19:44,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:44,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956575668] [2019-11-15 21:19:44,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:44,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:44,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:19:45,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956575668] [2019-11-15 21:19:45,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218140574] [2019-11-15 21:19:45,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:19:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:45,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-15 21:19:45,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:45,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:45,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:19:45,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:45,216 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 21:19:45,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:45,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-15 21:19:45,235 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:45,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:19:45,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:45,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:45,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:45,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-11-15 21:19:45,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:19:45,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:45,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:45,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:45,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 21:19:45,330 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:45,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 56 [2019-11-15 21:19:45,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:19:45,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:45,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:19:45,351 INFO L567 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size [2019-11-15 21:19:45,351 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:19:45,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-11-15 21:19:45,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:45,458 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 41 treesize of output 82 [2019-11-15 21:19:45,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:45,484 INFO L567 ElimStorePlain]: treesize reduction 64, result has 41.8 percent of original size [2019-11-15 21:19:45,485 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:19:45,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2019-11-15 21:19:45,654 INFO L341 Elim1Store]: treesize reduction 34, result has 65.7 percent of original size [2019-11-15 21:19:45,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 98 [2019-11-15 21:19:45,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:45,681 INFO L567 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-11-15 21:19:45,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:19:45,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:70 [2019-11-15 21:19:46,452 INFO L341 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-15 21:19:46,453 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 86 treesize of output 106 [2019-11-15 21:19:46,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:46,470 INFO L567 ElimStorePlain]: treesize reduction 56, result has 24.3 percent of original size [2019-11-15 21:19:46,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:46,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:86, output treesize:10 [2019-11-15 21:19:46,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:46,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 32 [2019-11-15 21:19:46,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:46,516 INFO L567 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-11-15 21:19:46,517 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:19:46,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-11-15 21:19:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:19:46,571 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:19:46,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 39 [2019-11-15 21:19:46,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559664493] [2019-11-15 21:19:46,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 21:19:46,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 21:19:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1461, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 21:19:46,573 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 40 states. [2019-11-15 21:19:47,983 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-11-15 21:19:48,563 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-11-15 21:19:48,970 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-11-15 21:19:49,230 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-11-15 21:19:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:50,014 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-15 21:19:50,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:19:50,016 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2019-11-15 21:19:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:19:50,016 INFO L225 Difference]: With dead ends: 97 [2019-11-15 21:19:50,017 INFO L226 Difference]: Without dead ends: 97 [2019-11-15 21:19:50,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=345, Invalid=3437, Unknown=0, NotChecked=0, Total=3782 [2019-11-15 21:19:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-15 21:19:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-11-15 21:19:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 21:19:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2019-11-15 21:19:50,020 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 44 [2019-11-15 21:19:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:19:50,021 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2019-11-15 21:19:50,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 21:19:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2019-11-15 21:19:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:19:50,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:19:50,022 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:50,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:50,225 INFO L410 AbstractCegarLoop]: === Iteration 23 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:19:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash -695184262, now seen corresponding path program 1 times [2019-11-15 21:19:50,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:50,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846857783] [2019-11-15 21:19:50,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:50,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:50,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:19:50,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846857783] [2019-11-15 21:19:50,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17564154] [2019-11-15 21:19:50,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:19:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:50,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-15 21:19:50,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:50,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:50,786 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:19:50,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:50,806 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:19:50,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:50,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 21:19:50,825 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:50,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-15 21:19:50,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:50,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:50,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:50,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-11-15 21:19:50,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:19:50,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:50,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:50,885 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:19:50,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2019-11-15 21:19:50,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:50,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 52 [2019-11-15 21:19:50,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:50,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:50,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:50,970 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:19:50,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-11-15 21:19:51,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:51,078 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 33 treesize of output 78 [2019-11-15 21:19:51,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:51,105 INFO L567 ElimStorePlain]: treesize reduction 64, result has 37.9 percent of original size [2019-11-15 21:19:51,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:19:51,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:39 [2019-11-15 21:19:51,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:51,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 128 [2019-11-15 21:19:51,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:19:51,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:19:51,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,189 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:19:51,230 INFO L567 ElimStorePlain]: treesize reduction 80, result has 39.8 percent of original size [2019-11-15 21:19:51,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 21:19:51,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:56 [2019-11-15 21:19:51,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:19:51,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:01,362 WARN L191 SmtUtils]: Spent 10.02 s on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2019-11-15 21:20:03,412 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 21:20:05,466 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 21:20:07,523 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 21:20:09,606 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 21:20:11,666 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 21:20:11,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:11,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 67 [2019-11-15 21:20:11,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:11,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:11,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:11,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:11,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:11,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:11,697 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:20:11,723 INFO L567 ElimStorePlain]: treesize reduction 26, result has 58.7 percent of original size [2019-11-15 21:20:11,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:11,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:11,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:22 [2019-11-15 21:20:11,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:11,832 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 19 treesize of output 21 [2019-11-15 21:20:11,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:11,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:11,849 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 18 treesize of output 34 [2019-11-15 21:20:11,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:11,885 INFO L567 ElimStorePlain]: treesize reduction 23, result has 54.0 percent of original size [2019-11-15 21:20:11,885 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 2 xjuncts. [2019-11-15 21:20:11,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:24 [2019-11-15 21:20:11,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:11,996 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:11,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2019-11-15 21:20:11,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977253616] [2019-11-15 21:20:11,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-15 21:20:11,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:11,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-15 21:20:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 21:20:11,998 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 39 states. [2019-11-15 21:20:18,224 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 77 [2019-11-15 21:20:20,324 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 21:20:22,381 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 21:20:24,447 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:20:28,532 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 21:20:32,648 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 21:20:40,809 WARN L191 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-15 21:20:48,946 WARN L191 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-15 21:20:53,220 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 21:21:01,438 WARN L191 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-11-15 21:21:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:01,991 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2019-11-15 21:21:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 21:21:01,991 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 44 [2019-11-15 21:21:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:01,992 INFO L225 Difference]: With dead ends: 96 [2019-11-15 21:21:01,992 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 21:21:01,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 66.7s TimeCoverageRelationStatistics Valid=405, Invalid=3627, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 21:21:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 21:21:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-11-15 21:21:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 21:21:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2019-11-15 21:21:01,996 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 44 [2019-11-15 21:21:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:01,996 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2019-11-15 21:21:01,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-15 21:21:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2019-11-15 21:21:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:21:01,997 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:01,997 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:02,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:02,204 INFO L410 AbstractCegarLoop]: === Iteration 24 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:21:02,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:02,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1597102842, now seen corresponding path program 1 times [2019-11-15 21:21:02,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:02,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600876327] [2019-11-15 21:21:02,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:02,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:02,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:02,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600876327] [2019-11-15 21:21:02,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933527408] [2019-11-15 21:21:02,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:21:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:02,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 21:21:02,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:02,715 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 21:21:02,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:02,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:5 [2019-11-15 21:21:02,731 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:02,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:21:02,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,744 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 21:21:02,744 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:21:02,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-15 21:21:02,789 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:02,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:21:02,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:02,798 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:21:02,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2019-11-15 21:21:02,858 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:21:02,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:02,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-15 21:21:03,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:03,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2019-11-15 21:21:03,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:03,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:21:03,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:03,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:03,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 21:21:03,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:03,184 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:03,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 35 [2019-11-15 21:21:03,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:03,193 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 19 treesize of output 21 [2019-11-15 21:21:03,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:03,237 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-11-15 21:21:03,237 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 2 xjuncts. [2019-11-15 21:21:03,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2019-11-15 21:21:03,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:03,334 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:03,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2019-11-15 21:21:03,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137216426] [2019-11-15 21:21:03,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 21:21:03,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:03,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 21:21:03,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2019-11-15 21:21:03,337 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 31 states. [2019-11-15 21:21:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:04,500 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-11-15 21:21:04,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:21:04,501 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2019-11-15 21:21:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:04,501 INFO L225 Difference]: With dead ends: 90 [2019-11-15 21:21:04,501 INFO L226 Difference]: Without dead ends: 90 [2019-11-15 21:21:04,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=197, Invalid=1609, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 21:21:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-15 21:21:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-15 21:21:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 21:21:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2019-11-15 21:21:04,505 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 44 [2019-11-15 21:21:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:04,505 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2019-11-15 21:21:04,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 21:21:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2019-11-15 21:21:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:21:04,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:04,506 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:04,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:04,710 INFO L410 AbstractCegarLoop]: === Iteration 25 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:21:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1757091995, now seen corresponding path program 1 times [2019-11-15 21:21:04,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:04,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117385588] [2019-11-15 21:21:04,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:04,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:04,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:05,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117385588] [2019-11-15 21:21:05,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832052414] [2019-11-15 21:21:05,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:21:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:05,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 21:21:05,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:05,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:05,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:21:05,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,794 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 21:21:05,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-15 21:21:05,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:05,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:21:05,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:05,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-11-15 21:21:05,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:21:05,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:05,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-15 21:21:05,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:05,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-15 21:21:05,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:05,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:05,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:05,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:46 [2019-11-15 21:21:06,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:06,103 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 50 treesize of output 87 [2019-11-15 21:21:06,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:06,145 INFO L567 ElimStorePlain]: treesize reduction 64, result has 45.3 percent of original size [2019-11-15 21:21:06,145 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:21:06,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:53 [2019-11-15 21:21:06,253 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:06,253 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 3 case distinctions, treesize of input 57 treesize of output 111 [2019-11-15 21:21:06,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:06,291 INFO L567 ElimStorePlain]: treesize reduction 64, result has 47.1 percent of original size [2019-11-15 21:21:06,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:06,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-11-15 21:21:06,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:06,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:06,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:06,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 184 [2019-11-15 21:21:06,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:06,978 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:07,048 INFO L567 ElimStorePlain]: treesize reduction 108, result has 30.3 percent of original size [2019-11-15 21:21:07,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:07,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:97 [2019-11-15 21:21:07,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:07,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:21:07,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:21:07,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:07,382 INFO L567 ElimStorePlain]: treesize reduction 4, result has 82.6 percent of original size [2019-11-15 21:21:07,383 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:21:07,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2019-11-15 21:21:07,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:07,455 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 30 [2019-11-15 21:21:07,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:07,468 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-15 21:21:07,468 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:21:07,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-15 21:21:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:07,539 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:07,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 44 [2019-11-15 21:21:07,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137901914] [2019-11-15 21:21:07,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 21:21:07,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:07,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 21:21:07,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1865, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 21:21:07,541 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 45 states. [2019-11-15 21:21:09,102 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-11-15 21:21:09,729 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-11-15 21:21:09,899 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-11-15 21:21:10,109 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 78 [2019-11-15 21:21:10,364 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2019-11-15 21:21:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:11,458 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-11-15 21:21:11,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 21:21:11,458 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 46 [2019-11-15 21:21:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:11,459 INFO L225 Difference]: With dead ends: 94 [2019-11-15 21:21:11,459 INFO L226 Difference]: Without dead ends: 94 [2019-11-15 21:21:11,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=394, Invalid=4298, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 21:21:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-15 21:21:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-11-15 21:21:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-15 21:21:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2019-11-15 21:21:11,463 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 46 [2019-11-15 21:21:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:11,464 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2019-11-15 21:21:11,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 21:21:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2019-11-15 21:21:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:21:11,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:11,465 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:11,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:11,668 INFO L410 AbstractCegarLoop]: === Iteration 26 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:21:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:11,668 INFO L82 PathProgramCache]: Analyzing trace with hash 52368473, now seen corresponding path program 1 times [2019-11-15 21:21:11,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:11,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143132870] [2019-11-15 21:21:11,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:11,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:11,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:12,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143132870] [2019-11-15 21:21:12,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357361564] [2019-11-15 21:21:12,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:12,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 21:21:12,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:12,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:12,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-15 21:21:12,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:12,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:12,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:12,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-11-15 21:21:12,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:21:12,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:12,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:12,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:12,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 21:21:12,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:12,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 52 [2019-11-15 21:21:12,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:21:12,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:12,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:21:12,566 INFO L567 ElimStorePlain]: treesize reduction 29, result has 53.2 percent of original size [2019-11-15 21:21:12,566 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:21:12,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-11-15 21:21:12,667 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:12,667 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 33 treesize of output 78 [2019-11-15 21:21:12,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:12,693 INFO L567 ElimStorePlain]: treesize reduction 64, result has 37.9 percent of original size [2019-11-15 21:21:12,694 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:21:12,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2019-11-15 21:21:12,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:12,774 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:12,774 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 3 case distinctions, treesize of input 42 treesize of output 108 [2019-11-15 21:21:12,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:12,801 INFO L567 ElimStorePlain]: treesize reduction 68, result has 41.4 percent of original size [2019-11-15 21:21:12,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:12,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:51 [2019-11-15 21:21:13,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:13,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:13,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:13,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:13,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 61 treesize of output 183 [2019-11-15 21:21:13,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,426 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:13,506 INFO L567 ElimStorePlain]: treesize reduction 112, result has 32.1 percent of original size [2019-11-15 21:21:13,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:13,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:75, output treesize:148 [2019-11-15 21:21:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:21:13,799 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 0 case distinctions, treesize of input 23 treesize of output 25 [2019-11-15 21:21:13,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:13,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:13,818 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 21 treesize of output 37 [2019-11-15 21:21:13,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:13,837 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:13,837 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 18 treesize of output 34 [2019-11-15 21:21:13,838 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:13,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-11-15 21:21:13,844 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:13,943 INFO L567 ElimStorePlain]: treesize reduction 37, result has 66.1 percent of original size [2019-11-15 21:21:13,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-11-15 21:21:13,944 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:72 [2019-11-15 21:21:13,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:13,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:21:14,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,306 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 51 [2019-11-15 21:21:14,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 61 [2019-11-15 21:21:14,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 61 [2019-11-15 21:21:14,361 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,376 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 18 treesize of output 34 [2019-11-15 21:21:14,376 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,392 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,393 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 15 treesize of output 31 [2019-11-15 21:21:14,393 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:14,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 64 [2019-11-15 21:21:14,420 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:14,556 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-11-15 21:21:14,556 INFO L567 ElimStorePlain]: treesize reduction 130, result has 49.4 percent of original size [2019-11-15 21:21:14,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-15 21:21:14,557 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:121, output treesize:127 [2019-11-15 21:21:14,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:21:14,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:14,762 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:14,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 42 [2019-11-15 21:21:14,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072546217] [2019-11-15 21:21:14,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 21:21:14,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:14,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 21:21:14,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1686, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 21:21:14,764 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 43 states. [2019-11-15 21:21:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:17,851 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-11-15 21:21:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:21:17,852 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 47 [2019-11-15 21:21:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:17,852 INFO L225 Difference]: With dead ends: 91 [2019-11-15 21:21:17,852 INFO L226 Difference]: Without dead ends: 91 [2019-11-15 21:21:17,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=379, Invalid=3911, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 21:21:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-15 21:21:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-11-15 21:21:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 21:21:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-11-15 21:21:17,856 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 47 [2019-11-15 21:21:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:17,857 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-11-15 21:21:17,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 21:21:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-11-15 21:21:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:21:17,857 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:17,857 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:18,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:18,058 INFO L410 AbstractCegarLoop]: === Iteration 27 === [_destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2019-11-15 21:21:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1824516203, now seen corresponding path program 1 times [2019-11-15 21:21:18,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:18,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500137175] [2019-11-15 21:21:18,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:18,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:18,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:18,143 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:18,143 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:21:18,171 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-15 21:21:18,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:21:18 BoogieIcfgContainer [2019-11-15 21:21:18,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:21:18,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:21:18,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:21:18,207 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:21:18,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:18:19" (3/4) ... [2019-11-15 21:21:18,211 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:21:18,211 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:21:18,212 INFO L168 Benchmark]: Toolchain (without parser) took 179977.08 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 447.2 MB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -347.1 MB). Peak memory consumption was 100.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:18,213 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:18,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:18,213 INFO L168 Benchmark]: Boogie Preprocessor took 59.96 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:21:18,214 INFO L168 Benchmark]: RCFGBuilder took 786.51 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: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:18,218 INFO L168 Benchmark]: TraceAbstraction took 178660.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -254.4 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:18,218 INFO L168 Benchmark]: Witness Printer took 4.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:18,225 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 461.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.96 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 786.51 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: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 178660.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -254.4 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; VAL [len=3] [L618] CALL, EXPR dll_circular_create(len) VAL [\old(len)=3] [L564] DLL last = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, last={-1:0}, len=3, malloc(sizeof(struct node))={-1:0}] [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={-1:0}, len=3, malloc(sizeof(struct node))={-1:0}] [L568] last->next = last VAL [\old(len)=3, last={-1:0}, len=3, malloc(sizeof(struct node))={-1:0}] [L569] last->prev = last VAL [\old(len)=3, last={-1:0}, len=3, malloc(sizeof(struct node))={-1:0}] [L570] DLL head = last; VAL [\old(len)=3, head={-1:0}, last={-1:0}, len=3, malloc(sizeof(struct node))={-1:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-1:0}, last={-1:0}, len=3, malloc(sizeof(struct node))={2:0}, malloc(sizeof(struct node))={-1:0}, new_head={2:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-1:0}, last={-1:0}, len=3, malloc(sizeof(struct node))={2:0}, malloc(sizeof(struct node))={-1:0}, new_head={2:0}] [L576] new_head->next = head VAL [\old(len)=3, head={-1:0}, last={-1:0}, len=3, malloc(sizeof(struct node))={2:0}, malloc(sizeof(struct node))={-1:0}, new_head={2:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={-1:0}, last={-1:0}, len=3, malloc(sizeof(struct node))={2:0}, malloc(sizeof(struct node))={-1:0}, new_head={2:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={2:0}, last={-1:0}, len=2, malloc(sizeof(struct node))={2:0}, malloc(sizeof(struct node))={-1:0}, new_head={2:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={2:0}, last={-1:0}, len=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, new_head={7:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={2:0}, last={-1:0}, len=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, new_head={7:0}] [L576] new_head->next = head VAL [\old(len)=3, head={2:0}, last={-1:0}, len=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, new_head={7:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={2:0}, last={-1:0}, len=2, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, new_head={7:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={7:0}, last={-1:0}, len=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, new_head={7:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={7:0}, last={-1:0}, len=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, new_head={7:0}] [L581] last->next = head VAL [\old(len)=3, head={7:0}, last={-1:0}, len=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, new_head={7:0}] [L582] head->prev = last VAL [\old(len)=3, head={7:0}, last={-1:0}, len=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, new_head={7:0}] [L583] return head; VAL [\old(len)=3, \result={7:0}, head={7:0}, last={-1:0}, len=1, malloc(sizeof(struct node))={7:0}, malloc(sizeof(struct node))={-1:0}, new_head={7:0}] [L618] RET, EXPR dll_circular_create(len) VAL [dll_circular_create(len)={7:0}, len=3] [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) VAL [head={7:0}] [L586] EXPR head->prev VAL [head={7:0}, head={7:0}, head->prev={-1:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={7:0}, head={7:0}, head->next={2:0}, pred={-1:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={7:0}, head={7:0}, pred={-1:0}, succ={2:0}] [L607] free(pred) VAL [head={7:0}, head={7:0}, pred={-1:0}, succ={2:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={7:0}, head={7:0}, pred={-1:0}, succ={2:0}] [L612] free(head) VAL [head={7:0}, head={7:0}, pred={-1:0}, succ={2:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) VAL [head={7:0}, len=3] [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 153 locations, 59 error locations. Result: UNSAFE, OverallTime: 178.6s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 115.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2150 SDtfs, 4273 SDslu, 10738 SDs, 0 SdLazy, 21654 SolverSat, 983 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1107 GetRequests, 392 SyntacticMatches, 20 SemanticMatches, 695 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5036 ImplicationChecksByTransitivity, 142.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 53 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 57.5s InterpolantComputationTime, 1321 NumberOfCodeBlocks, 1321 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1235 ConstructedInterpolants, 161 QuantifiedInterpolants, 634934 SizeOfPredicates, 178 NumberOfNonLiveVariables, 2371 ConjunctsInSsa, 512 ConjunctsInUnsatCore, 38 InterpolantComputations, 14 PerfectInterpolantSequences, 54/193 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:21:20,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:21:20,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:21:20,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:21:20,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:21:20,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:21:20,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:21:20,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:21:20,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:21:20,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:21:20,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:21:20,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:21:20,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:21:20,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:21:20,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:21:20,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:21:20,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:21:20,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:21:20,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:21:20,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:21:20,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:21:20,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:21:20,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:21:20,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:21:20,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:21:20,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:21:20,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:21:20,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:21:20,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:21:20,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:21:20,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:21:20,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:21:20,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:21:20,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:21:20,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:21:20,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:21:20,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:21:20,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:21:20,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:21:20,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:21:20,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:21:20,292 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 21:21:20,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:21:20,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:21:20,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:21:20,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:21:20,306 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:21:20,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:21:20,307 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:21:20,307 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:21:20,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:21:20,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:21:20,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:21:20,308 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:21:20,308 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:21:20,308 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:21:20,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:21:20,309 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:21:20,309 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:21:20,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:21:20,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:21:20,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:21:20,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:21:20,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:21:20,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:21:20,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:21:20,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:21:20,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:21:20,311 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:21:20,311 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:21:20,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:21:20,312 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_ce941d04-bee8-47bd-bfab-3669085a240c/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 -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2019-11-15 21:21:20,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:21:20,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:21:20,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:21:20,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:21:20,356 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:21:20,356 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-11-15 21:21:20,406 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data/b1d55617d/983910cc510f4605a1119da9b47a09c9/FLAG2e54a67a8 [2019-11-15 21:21:20,819 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:21:20,820 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-11-15 21:21:20,832 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data/b1d55617d/983910cc510f4605a1119da9b47a09c9/FLAG2e54a67a8 [2019-11-15 21:21:21,135 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/bin/uautomizer/data/b1d55617d/983910cc510f4605a1119da9b47a09c9 [2019-11-15 21:21:21,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:21:21,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:21:21,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:21,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:21:21,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:21:21,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:21" (1/1) ... [2019-11-15 21:21:21,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dff8f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21, skipping insertion in model container [2019-11-15 21:21:21,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:21" (1/1) ... [2019-11-15 21:21:21,153 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:21:21,207 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:21:21,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:21,693 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:21:21,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:21,795 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:21:21,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21 WrapperNode [2019-11-15 21:21:21,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:21,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:21:21,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:21:21,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:21:21,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21" (1/1) ... [2019-11-15 21:21:21,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21" (1/1) ... [2019-11-15 21:21:21,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21" (1/1) ... [2019-11-15 21:21:21,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21" (1/1) ... [2019-11-15 21:21:21,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21" (1/1) ... [2019-11-15 21:21:21,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21" (1/1) ... [2019-11-15 21:21:21,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21" (1/1) ... [2019-11-15 21:21:21,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:21:21,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:21:21,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:21:21,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:21:21,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:21:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:21:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:21:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:21:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:21:21,971 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:21:21,971 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-15 21:21:21,971 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2019-11-15 21:21:21,971 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:21:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:21:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:21:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:21:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:21:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:21:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:21:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:21:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:21:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:21:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:21:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:21:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:21:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:21:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:21:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:21:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:21:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:21:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:21:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:21:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:21:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:21:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:21:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:21:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:21:21,976 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:21:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:21:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:21:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:21:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:21:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:21:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:21:21,980 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:21:21,980 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:21:21,980 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:21:21,980 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:21:21,980 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:21:21,981 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:21:21,982 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:21:21,982 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:21:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:21:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:21:21,983 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:21:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:21:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:21:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:21:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:21:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:21:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:21:21,984 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:21:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:21:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:21:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:21:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:21:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:21:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:21:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:21:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:21:21,985 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:21:21,986 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:21:21,986 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:21:21,986 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:21:21,986 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:21:21,986 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:21:21,986 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:21:21,987 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:21:21,987 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:21:21,987 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:21:21,987 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:21:21,987 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:21:21,987 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:21:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:21:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:21:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:21:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:21:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:21:21,988 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:21:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:21:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:21:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:21:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2019-11-15 21:21:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:21:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:21:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:21:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:21:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:21:22,755 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:21:22,786 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:21:22,786 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-15 21:21:22,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:22 BoogieIcfgContainer [2019-11-15 21:21:22,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:21:22,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:21:22,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:21:22,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:21:22,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:21:21" (1/3) ... [2019-11-15 21:21:22,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66076f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:21:22, skipping insertion in model container [2019-11-15 21:21:22,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:21" (2/3) ... [2019-11-15 21:21:22,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66076f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:21:22, skipping insertion in model container [2019-11-15 21:21:22,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:22" (3/3) ... [2019-11-15 21:21:22,795 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2019-11-15 21:21:22,804 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:21:22,811 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2019-11-15 21:21:22,821 INFO L249 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2019-11-15 21:21:22,843 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:21:22,843 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:21:22,852 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:21:22,854 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:21:22,854 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:21:22,854 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:21:22,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:21:22,855 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:21:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-15 21:21:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:21:22,890 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:22,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:22,893 INFO L410 AbstractCegarLoop]: === Iteration 1 === [_destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr38ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr33ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr43ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr35ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr37ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr41ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr45ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr32ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr39ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr34ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr36ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr44ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr42ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr40ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION]=== [2019-11-15 21:21:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash 336039556, now seen corresponding path program 1 times [2019-11-15 21:21:22,907 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:22,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1879847393] [2019-11-15 21:21:22,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce941d04-bee8-47bd-bfab-3669085a240c/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:21:23,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:23,140 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:21:23,144 INFO L168 Benchmark]: Toolchain (without parser) took 2004.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -112.1 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:23,144 INFO L168 Benchmark]: CDTParser took 0.29 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:21:23,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:23,146 INFO L168 Benchmark]: Boogie Preprocessor took 117.10 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:23,146 INFO L168 Benchmark]: RCFGBuilder took 871.18 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:23,147 INFO L168 Benchmark]: TraceAbstraction took 353.69 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:23,150 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 656.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.10 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 871.18 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 353.69 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: 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...